Resistance distance and Kirchhoff index in generalized R-vertex and R-edge corona for graphs
classification
🧮 math.SP
math.CO
keywords
graphcoronadistanceedgegeneralizedindexkirchhoffr-edge
read the original abstract
For a graph G, the graph R(G) of a graph G is the graph obtained by adding a new vertex for each edge of G and joining each new vertex to both end vertices of the correspond- ing edge. Let I(G) be the set of newly added vertices. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of generalized R-vertex and R-edge corona whenever G and Hi are arbitrary graph. These results generalize the existing results in [9].
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.