Resistance distance and Kirchhoff index in the corona-vertex and the corona $-$ edge of subdivision graph
Qun Liu, Jia-Bao Liu, Shaohui Wang, Masoud Karimi

TL;DR
This paper derives formulas for resistance distance and Kirchhoff index in two types of corona graphs based on subdivision graphs, generalizing previous results to arbitrary graphs.
Contribution
It provides the first general formulas for resistance distance and Kirchhoff index in corona-vertex and corona-edge subdivision graphs for arbitrary graphs.
Findings
Formulas for resistance distance in $G_{1}\diamondsuit G_{2}$ and $G_{1}\star G_{2}$.
Formulas for Kirchhoff index in these corona graphs.
Generalization of previous specific cases.
Abstract
The subdivision graph of a graph is the graph obtained by inserting a new vertex into every edge of . In , 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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Graphene research and applications
