Topics in matrix analysis
The Laplacian spectrum of a graph
SIAM Journal on Matrix Analysis and Applications
The Laplacian Spectrum of a Graph II
SIAM Journal on Discrete Mathematics
Kirchhoff index of composite graphs
Discrete Applied Mathematics
Kirchhoff index in line, subdivision and total graphs of a regular graph
Discrete Applied Mathematics
Laplacian spectra of regular graph transformations
Discrete Applied Mathematics
Hi-index | 0.04 |
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, and Q(G) be the graph obtained from G by inserting a new vertex into every edge of G and by joining by edges those pairs of these new vertices which lie on adjacent edges of G. In this paper, we determine the Laplacian polynomials of R(G) and Q(G) of a regular graph G; on the other hand, we derive formulae and lower bounds of the Kirchhoff index of these graphs.