English

The resistance distance of a dual number weighted graph

Combinatorics 2025-02-20 v1

Abstract

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

Keywords

Cite

@article{arxiv.2502.13455,
  title  = {The resistance distance of a dual number weighted graph},
  author = {Yu Li and Lizhu Sun and Changjiang Bu},
  journal= {arXiv preprint arXiv:2502.13455},
  year   = {2025}
}

Comments

24 pages