22 search results - page 1 / 5 » On the largest eigenvalue of non-regular graphs |
CPC
2002
13 years 7 months ago
2002
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
DM
1999
13 years 7 months ago
1999
Let G be a simple graph with n( 2) vertices, and i(G) be the ith largest eigenvalue of G. In this paper we obtain the following: If 3(G) < 0, and there exists some index k, 2 ...
JCT
2007
13 years 7 months 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...
EJC
2010
13 years 7 months ago
2010
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...