Abstract
Let G be a connected graph with vertex set V(G). The resistance distance between any two vertices u, v ∈ V(G) is the net effective resistance between them in the electric network constructed from G by replacing each edge with a unit resistor. Let S ⊂ V(G) be a set of vertices such that all the vertices in S have the same neighborhood in G − S, and let G[S] be the subgraph induced by S. In this note, by the {1}-inverse of the Laplacian matrix of G, formula for resistance distances between vertices in S is obtained. It turns out that resistance distances between vertices in S could be given in terms of elements in the inverse matrix of an auxiliary matrix of the Laplacian matrix of G[S], which derives the reduction principle obtained in [J. Phys. A: Math. Theor. 41 (2008) 445203] by algebraic method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
