Sciweavers

2270 search results - page 1 / 454
» On the distribution of eigenvalues of graphs
Sort
View
DM
1999
89views more  DM 1999»
13 years 4 months ago
On the distribution of eigenvalues of graphs
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 ...
Alexander K. Kelmans, Xuerong Yong
APPML
2006
80views more  APPML 2006»
13 years 5 months ago
Unicyclic graphs with exactly two main eigenvalues
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
Yaoping Hou, Feng Tian
CORR
2011
Springer
202views Education» more  CORR 2011»
12 years 12 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
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...
Alan M. Frieze, Charalampos E. Tsourakakis
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 11 months ago
A Bootstrap Approach to Eigenvalue Correction
—Eigenvalue analysis is an important aspect in many data modeling methods. Unfortunately, the eigenvalues of the sample covariance matrix (sample eigenvalues) are biased estimate...
Anne Hendrikse, Luuk J. Spreeuwers, Raymond N. J. ...
COMBINATORICS
2007
79views more  COMBINATORICS 2007»
13 years 4 months ago
On the Spectrum of the Derangement Graph
We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.
Paul Renteln