Bounds on graph eigenvalues. I
From MaRDI portal
Publication:861032
DOI10.1016/J.LAA.2006.08.020zbMath1109.05073arXivmath/0602027OpenAlexW2025858038MaRDI QIDQ861032
Publication date: 9 January 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602027
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (21)
A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER ⋮ The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number ⋮ Domination number and Laplacian eigenvalue distribution ⋮ Unnamed Item ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian ⋮ Lower bounds for the Laplacian spectral radius of graphs ⋮ Eigenvalues of subgraphs of the cube ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Some spectral properties of the non-backtracking matrix of a graph ⋮ Bounds on Laplacian eigenvalues related to total and signed domination of graphs ⋮ The spectral radius and domination number in linear uniform hypergraphs ⋮ Domination and Spectral Graph Theory ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Laplacian and signless Laplacian spectral radii of graphs with fixed domination number ⋮ Network synchronizability analysis: A graph-theoretic approach ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities ⋮ The product of two high-frequency graph Laplacian eigenfunctions is smooth
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds of Laplacian spectrum of graphs based on the domination number
- Laplace eigenvalues of graphs---a survey
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Bounds of eigenvalues of graphs
- Bounds on eigenvalues and chromatic numbers
- Two sharp upper bounds for the Laplacian eigenvalues.
- Sharp upper bounds on the spectral radius of graphs
- On the spectral radius of graphs
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Some new bounds on the spectral radius of graphs
- A sharp upper bound of the spectral radius of graphs
- Sharp upper bounds for the Laplacian graph eigenvalues
- A new upper bound for the spectral radius of graphs with girth at least 5
- Some Inequalities for the Largest Eigenvalue of a Graph
- On Moore Graphs with Diameters 2 and 3
- Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
- The Laplacian Spectrum of a Graph II
This page was built for publication: Bounds on graph eigenvalues. I