Resistance distance and Kirchhoff index in the corona-vertex and the corona - edge of subdivision graph
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 PL, two classes of new corona graphs, the corona-vertex of the subdivision graph G1 G2 and corona-edge of the subdivision graph G1 G2 were defined. The adjacency spectrum and the signless Laplacian spectrum of the two new graphs were computed when G1 is an arbitrary graph and G2 is an r-regular graph. In this paper, we give the formulate of the resistance distance and the Kirchhoff index in G1 G2 and G1 G2 when G1 and G2 are arbitrary graphs. These results generalize them in PL.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.