Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach

preprint2015arXivOpen access

Abstract

Let G1G_1 and G2G_2 be two graphs on disjoint sets of n1n_1 and n2n_2 vertices, respectively. The corona of graphs G1G_1 and G2G_2, denoted by G1∘G2G_1\circ G_2, is the graph formed from one copy of G1G_1 and n1n_1 copies of G2G_2 where the ii-th vertex of G1G_1 is adjacent to every vertex in the ii-th copy of G2G_2. The neighborhood corona of G1G_1 and G2G_2, denoted by G1⋄G2G_1\diamond G_2, is the graph obtained by taking one copy of G1G_1 and n1n_1 copies of G2G_2 and joining every neighbor of the ii-th vertex of G1G_1 to every vertex in the ii-th copy of G2G_2 by a new edge. In this paper, the Laplacian generalized inverse for the graphs G1∘G2G_1\circ G_2 and G1⋄G2G_1\diamond G_2 are investigated, based on which the resistance distances of any two vertices in G1∘G2G_1\circ G_2 and G1⋄G2G_1\diamond G_2 can be obtained. Moreover, some examples as applications are presented, which illustrate the correction and efficiency of the proposed method.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.