Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 77 tok/s Pro
Kimi K2 200 tok/s Pro
GPT OSS 120B 427 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

The resistance distance of a dual number weighted graph (2502.13455v1)

Published 19 Feb 2025 in math.CO

Abstract: For a graph $G=(V,E)$, assigning each edge $e\in E$ a weight of a dual number $w(e)=1+\widehat{a}{e}\varepsilon$, the weighted graph $G{w}=(V,E,w)$ is called a dual number weighted graph, where $-\widehat{a}{e}$ can be regarded as the perturbation of the unit resistor on edge $e$ of $G$. For a connected dual number weighted graph $G{w}$, we give some expressions and block representations of generalized inverses of the Laplacian matrix of $G{w}$. And using these results, we derive the explicit formulas of the resistance distance and Kirchhoff index of $G{w}$. We give the perturbation bounds for the resistance distance and Kirchhoff index of $G$. In particular, when only the edge $e={i,j}$ of $G$ is perturbed, we give the perturbation bounds for the Kirchhoff index and resistance distance between vertices $i$ and $j$ of $G$, respectively.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.