Resistance Distance and Kirchhoff Index of Graphs with Pockets

Abstract

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

Related Papers

• → A note on the neighbor sum distinguishing total coloring of planar graphs(2016)12 cited
• → Maximum number of colorings of (2k, k2)‐graphs(2007)9 cited
• → Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph(2013)9 cited
• → AVD-total-colouring of complete equipartite graphs(2015)3 cited
• → Parity Subgraph, Shortest Cycle Cover, and Postman Tour(1993)2 cited