Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach

Let G1 and G2 be two graphs on disjoint sets of n1 and n2 vertices, respectively. The corona of graphs G1 and G2, denoted by G1 ∘ G2, is the graph formed from one copy of G1 and n1 copies of G2 whe...