Abstract
In mathematics, a graph product is a binary operation on a graph. Graph products have been extensively researched and have many important applications in many fields. Here we discuss one graph-theoretical product. Let H be a labeled graph on n vertices and let G be a rooted graph. Denote by H G the graph obtained by identifying the root vertex of the ith copy of G with the ith vertex of H. H G is called by the rooted product of H by G [C. Godsil, B. D. McKay, A new graph product and its spectrum, Bull. Aust. Math. Soc. 18 (1978)]. The resistance distance between two vertices i and j of a graph G is defined as the effective resistance between the two vertices when a unit resistor replaces each edge of G. Let Hk;n , Cm , Sk , Pk and Ku be the Harary, cycle, star, path and complete graphs respectively. In this paper, the symmetric {1}-inverses of Laplacian matrices for graphs (Hk;n ○ Cm ), (Hk;n Ku ), (Cn ○ Sk ) and (Cn ○ Pk ) are studied, based on which the resistance distances of any two vertices in these graphs can be obtained. In addition, some examples are provided as applications that illustrate the functionality of the suggested method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.