English

The Laplacian polynomial of graphs derived from regular graphs and applications

Combinatorics 2014-11-21 v1

Abstract

Let R(G)R(G) be the graph obtained from GG by adding a new vertex corresponding to each edge of GG and by joining each new vertex to the end vertices of the corresponding edge. Let RT(G)RT(G) be the graph obtained from R(G)R(G) by adding a new edge corresponding to every vertex of GG, and by joining each new edge to every vertex of GG. In this paper, we determine the Laplacian polynomials of RT(G)RT(G) of a regular graph GG. 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.

Keywords

Cite

@article{arxiv.1411.5509,
  title  = {The Laplacian polynomial of graphs derived from regular graphs and applications},
  author = {Jia-Bao Liu and Xiang-Feng Pan and Fu-Tao Hu},
  journal= {arXiv preprint arXiv:1411.5509},
  year   = {2014}
}