pith. sign in

arxiv: 1411.5509 · v1 · pith:AITPL5ETnew · submitted 2014-11-20 · 🧮 math.CO

The Laplacian polynomial of graphs derived from regular graphs and applications

classification 🧮 math.CO
keywords edgegraphsvertexcorrespondinggraphaddingapplicationsevery
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.