The resistance distance of a dual number weighted graph
Combinatorics
2025-02-20 v1
Abstract
For a graph , assigning each edge a weight of a dual number , the weighted graph is called a dual number weighted graph, where can be regarded as the perturbation of the unit resistor on edge of . For a connected dual number weighted graph , we give some expressions and block representations of generalized inverses of the Laplacian matrix of . And using these results, we derive the explicit formulas of the resistance distance and Kirchhoff index of . We give the perturbation bounds for the resistance distance and Kirchhoff index of . In particular, when only the edge of is perturbed, we give the perturbation bounds for the Kirchhoff index and resistance distance between vertices and of , 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