Displaying similar documents to “On the Spectral Radius of Connected Graphs”

Asymptotic spectral analysis of growing graphs: odd graphs and spidernets

Daisuke Igarashi, Nobuaki Obata (2006)

Banach Center Publications

Similarity:

Two new examples are given for illustrating the method of quantum decomposition in the asymptotic spectral analysis for a growing family of graphs. The odd graphs form a growing family of distance-regular graphs and the two-sided Rayleigh distribution appears in the limit of vacuum spectral distribution of the adjacency matrix. For a spidernet as well as for a growing family of spidernets the vacuum distribution of the adjacency matrix is the free Meixner law. These distributions are...

A sharp upper bound for the spectral radius of a nonnegative matrix and applications

Lihua You, Yujie Shu, Xiao-Dong Zhang (2016)

Czechoslovak Mathematical Journal

Similarity:

We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results.