Chia-an Liu, Chih-wen Weng
Published 2012-08-09Version 1
Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give a sharp upper bound for rho(G) by a function of d_1, d_2, ..., d_L, which generalizes a series of previous results.
On the spectral moment of trees with given degree sequences
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
The number of ideals of $\mathbb{Z}[x]$ containing $x(x-α)(x-β)$ with given index
![QR code for arXiv:1208.1958 [math.CO]](http://oss.arxitics.com/images/favicon.svg)