12 search results - page 1 / 3 » The Spectral Radius and the Maximum Degree of Irregular Grap... |
COMBINATORICS
2007
15 years 10 days ago
2007
88
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
It is well known that the spectral radius of a tree whose maximum degree is ∆ cannot exceed 2 √
74
Voted
JCT
2007
15 years 7 days ago
2007
We study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degre...
COMBINATORICS
2004
15 years 6 days ago
2004
We propose two alternative measures of the local irregularity of a graph in terms of its vertex degrees and relate these measures to the order and the global irregularity of the g...
103
Voted
COMBINATORICA
2007
15 years 10 days ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...