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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
