Papers
Topics
Authors
Recent
Search
2000 character limit reached

The resistance distance of a dual number weighted graph

Published 19 Feb 2025 in math.CO | (2502.13455v1)

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

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Authors (3)

Collections

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