| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4599449 | Linear Algebra and its Applications | 2014 | 9 Pages |
Abstract
The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into every edge of G. Let G1âªG2 be the disjoint union of two graphs G1 and G2. The subdivision-vertex join of G1 and G2, denoted by G1â¨ËG2, is the graph obtained from S(G1)âªG2 by joining every vertex in V(G1) to every vertex in V(G2). The subdivision-edge join of G1 and G2, denoted by G1â»G2, is the graph obtained from S(G1)âªG2 by joining every vertex in I(G1) to every vertex in V(G2), where I(G1) is the set of inserted vertices of S(G1). In this paper, formulae for resistance distance in G1â¨ËG2 and G1â»G2 are obtained.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Changjiang Bu, Bo Yan, Xiuqing Zhou, Jiang Zhou,