2024/10/17 by Bishal Sonar, Sonar, Bishal, Ravi Srivastava +1
Computer Science · #Graph Theory and Algorithms #Advanced Graph Theory Research #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2410.13388
The spectrum of Laplacian and signless Laplacian matrix for a graph product is obtained, where both underlying graphs are regular. As an application of this, we have been able to generate the Kirchhoff Index and Wiener Index and determine the number of spanning trees. Additionally, we derived the conditions necessary for obtaining a Laplacian and signless Laplacian integral product graph.