107 search results - page 8 / 22 » Eigenvalues of the derangement graph |
121
click to vote
COMBINATORICS
2007
15 years 1 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...
116
click to vote
COMBINATORICS
2007
15 years 1 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...
121
Voted
COMBINATORICA
2000
15 years 1 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 ...
137
Voted
SIAMJO
2008
15 years 1 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....
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...