pith. sign in

arxiv: 1611.04219 · v1 · pith:MV5QWMYRnew · submitted 2016-11-14 · 🧮 math.CO

Resistance distance and Kirchhoff index in the corona-vertex and the corona - edge of subdivision graph

classification 🧮 math.CO
keywords graphsubdivisiongraphsarbitrarycitecoronacorona-vertexdiamondsuit
0
0 comments X
read the original abstract

The subdivision graph $S(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into every edge of $G$. In $\cite{PL}$, two classes of new corona graphs, the corona-vertex of the subdivision graph $G_{1}\diamondsuit G_{2}$ and corona-edge of the subdivision graph $G_{1}\star G_{2}$ were defined. The adjacency spectrum and the signless Laplacian spectrum of the two new graphs were computed when $G_{1}$ is an arbitrary graph and $G_{2}$ is an $r$-regular graph. In this paper, we give the formulate of the resistance distance and the Kirchhoff index in $G_{1}\diamondsuit G_{2}$ and $G_{1}\star G_{2}$ when $G_{1}$ and $G_{2}$ are arbitrary graphs. These results generalize them in $\cite{PL}$.

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.