Sciweavers

368 search results - page 1 / 74
» Higher Eigenvalues of Graphs
Sort
View
FOCS
2009
IEEE
13 years 11 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 8 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
APPML
2006
80views more  APPML 2006»
13 years 4 months ago
Unicyclic graphs with exactly two main eigenvalues
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...
Yaoping Hou, Feng Tian
COMBINATORICS
2007
79views more  COMBINATORICS 2007»
13 years 4 months ago
On the Spectrum of the Derangement Graph
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.
Paul Renteln
CATS
2008
13 years 6 months ago
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
Using eigenvalue analysis, it was shown by Erd
Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-...