Abstract
Let and be two graphs on disjoint sets of and vertices, respectively. The corona of graphs and , denoted by , is the graph formed from one copy of and copies of where the -th vertex of is adjacent to every vertex in the -th copy of . The neighborhood corona of and , denoted by , is the graph obtained by taking one copy of and copies of and joining every neighbor of the -th vertex of to every vertex in the -th copy of by a new edge. In this paper, the Laplacian generalized inverse for the graphs and are investigated, based on which the resistance distances of any two vertices in and can be obtained. Moreover, some examples as applications are presented, which illustrate the correction and efficiency of the proposed method.
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.