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 ...
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...
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...
—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. ...
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.