Abstract
Motivated by the work of Zhang and Yan (2009), this paper considers the problem of computing resistance distances and Kirchhoff index of graphs with an involution. We show that if G is a weighted graph with an involution, then the resistance distance and the Kirchhoff index of G can be expressed in terms of parameters of two weighted graphs with a smaller size. As applications, we compute resistance distances and Kirchhoff indices of double graphs, the almost-complete graph and the almost-complete bipartite graph.
Sign-in/Register to access full text options 
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.
