Abstract
The subdivision graph of a graph is the graph obtained by inserting a new vertex into every edge of . In $\cite{PL}$, two classes of new corona graphs, the corona-vertex of the subdivision graph and corona-edge of the subdivision graph were defined. The adjacency spectrum and the signless Laplacian spectrum of the two new graphs were computed when is an arbitrary graph and is an -regular graph. In this paper, we give the formulate of the resistance distance and the Kirchhoff index in and when and are arbitrary graphs. These results generalize them in $\cite{PL}$.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.