107 search results - page 2 / 22 » Eigenvalues of the derangement graph |
CVPR
2011
IEEE
13 years 28 days ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
CORR
2011
Springer
13 years 15 days 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...
CATS
2008
13 years 7 months ago
2008
Using eigenvalue analysis, it was shown by Erd
EJC
2010
13 years 5 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
2010
Springer
13 years 2 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...