Walks, infinite series and spectral radius of graphs

Wenqian Zhang

Published 2024-06-12Version 1

For a graph G, the spectral radius \r{ho}(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we seek the relationship between \r{ho}(G) and the walks of the subgraphs of G. Especially, if G contains a complete multi-partite graph as a spanning subgraph, we give a formula for \r{ho}(G) by using an infinite series on walks of the subgraphs of G. These results are useful for the current popular spectral extremal problem.