2270 search results - page 12 / 454 » On the distribution of eigenvalues of graphs |
92
Voted
COMBINATORICS
2007
14 years 9 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite di...
80
Voted
COMBINATORICS
2007
14 years 9 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
COMBINATORICA
2000
14 years 9 months ago
2000
Given a connected graph, X, we denote by 2 = 2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n - 1 transpositions which generate the ...
SIAMJO
2008
14 years 9 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—Situations in many fields of research, such as digital communications, nuclear physics and mathematical finance, can be modelled with random matrices. When the matrices get la...