On sums of graph eigenvalues
From MaRDI portal
Publication:2015086
Abstract: We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both the standard combinatorial Laplacian and the renormalized Laplacian. We also provide upper bounds for sums of squares of eigenvalues of these three matrices. Among our results, we generalize an inequality of Fiedler for the extreme eigenvalues of the graph Laplacian to a bound on the sums of the smallest (or largest) k such eigenvalues, k < n. Furthermore, if lambda_j are the eigenvalues of the positive graph Laplacian H, in increasing order, on a finite graph with |V| vertices and |E| edges which is isomorphic to a subgraph of the
u-dimensional infinite cubic lattice, then the spectral sums obey a Weyl-type upper bound, a simplification of which reads sum_{j=1}^{k-1}{lambda_j} le frac{pi^2 |mathcal{E}|}{3} left(frac{k}{|mathcal{V}|} ight)^{1+frac{2}{ u}} for each k < |V|. This and related estimates for sums of lambda_j^2 provide a family of necessary conditions for the embeddability of the graph in a lattice of dimension
u or less.
Recommendations
- An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
- An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
- Eigenvalue sum estimates for lattice subgraphs
- Eigenvalues of the Laplacian of a graph∗
- Eigenvalue sums of combinatorial magnetic Laplacians on finite graphs
Cites work
- scientific article; zbMATH DE number 3533409 (Why is no real title available?)
- scientific article; zbMATH DE number 3622441 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3209277 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- An introduction to the theory of graph spectra
- Eigenspaces of graphs
- Graph theory
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- On sum of powers of the Laplacian eigenvalues of graphs
- On the Eigenvalues of Vibrating Membranes†
- On the Schrödinger equation and the eigenvalue problem
- On trace identities and universal eigenvalue estimates for some partial differential operators
- Trace identities for commutators, with applications to the distribution of eigenvalues
- Upper bounds for the Neumann eigenvalues on a bounded domain in Euclidean space
Cited in
(11)- Semiclassical estimates for eigenvalue means of Laplacians on spheres
- Semiclassical bounds for spectra of biharmonic operators
- Metric uniformization and spectral bounds for graphs
- Geometric bounds for the magnetic Neumann eigenvalues in the plane
- Two-term, asymptotically sharp estimates for eigenvalue means of the Laplacian
- An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
- Graph Embeddings and Laplacian Eigenvalues
- Eigenvalue sum estimates for lattice subgraphs
- On the spectral asymptotics for the buckling problem
- Eigenvalue sums of combinatorial magnetic Laplacians on finite graphs
- On the sum of Laplacian eigenvalues of graphs
This page was built for publication: On sums of graph eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015086)
