Sciweavers

368 search results - page 6 / 74
» Higher Eigenvalues of Graphs
Sort
View
STOC
2003
ACM
118views Algorithms» more  STOC 2003»
14 years 8 months ago
A proof of Alon's second eigenvalue conjecture
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
Joel Friedman
CVPR
2011
IEEE
13 years 3 months ago
Contour cut: identifying salient contours in images by solving a Hermitian eigenvalue problem
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...
Ryan Kennedy, Jean Gallier, Jianbo Shi
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 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
CCCG
2010
13 years 9 months ago
Some properties of higher order delaunay and gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
Prosenjit Bose, Sébastien Collette, Ferran ...