Abstract
Let be the graph obtained from by adding a new vertex corresponding to each edge of and by joining each new vertex to the end vertices of the corresponding edge. Let be the graph obtained from by adding a new edge corresponding to every vertex of , and by joining each new edge to every vertex of . In this paper, we determine the Laplacian polynomials of of a regular graph . Moreover, we derive formulae and lower bounds of Kirchhoff index of the graphs. Finally we also present the formulae for calculating the Kirchhoff index of some special graphs as applications, which show the correction and efficiency of the proposed results.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.