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 and be two vertex disjoint graphs. The subdivision-vertex corona of and , denoted by , is the graph obtained from and copies of , all vertex-disjoint, by joining the ith vertex of to every vertex in the ith copy of . The subdivision-edge corona of and , denoted by , is the graph obtained from and copies of , all vertex-disjoint, by joining the ith vertex of to every vertex in the ith copy of , where is the set of inserted vertices of . In this paper, -inverse for the Laplacian matrices of graphs and are proposed, based on which the explicit resistance distance can be obtained for the two-vertex resistance between arbitrary vertices in the graphs.
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.
