The Laplacian polynomial of graphs derived from regular graphs and applications
Abstract
Let R(G) be the graph obtained from G by adding a new vertex corresponding to each edge of G and by joining each new vertex to the end vertices of the corresponding edge. Let RT(G) be the graph obtained from R(G) by adding a new edge corresponding to every vertex of G, and by joining each new edge to every vertex of G. In this paper, we determine the Laplacian polynomials of RT(G) of a regular graph G. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.