Abstract
For a network, knowledge of its Laplacian eigenvalues is central to understanding its structure and dynamics. In this paper, we study the Laplacian spectra of a family of Koch networks with scale-free and small-world properties. We derive some recursive relations between the Laplacian characteristic polynomials of Koch networks and their subgraphs at different iterations. Based on the obtained recurrence relations, we determine explicitly the product of all nonzero Laplacian eigenvalues, as well as the sum of the reciprocals of these eigenvalues. Then, using these results, we further evaluate the number of spanning trees, Kirchhoff index, global mean first-passage time and average path length of the family of Koch networks. Finally, we determine the number of spanning forests under certain conditions. We expect that our method can be adapted to other types of self-similar networks.
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 callMore From: Journal of Physics A: Mathematical and Theoretical
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.
