Eigenvalue problems of Nordhaus--Gaddum type
From MaRDI portal
Publication:868345
DOI10.1016/j.disc.2006.07.035zbMath1122.15020arXivmath/0506260OpenAlexW1964076852MaRDI QIDQ868345
Publication date: 2 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0506260
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)
Related Items
A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph, Some Nordhaus-Gaddum type results of \(A_\alpha \)-eigenvalues of weighted graphs, Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph, Maximum spread of graphs and bipartite graphs, Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues, Generalizations of some Nordhaus–Gaddum‐type results on spectral radius, Proof of a conjecture of V. Nikiforov, Graph Limits and Spectral Extremal Problems for Graphs, Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues, More eigenvalue problems of Nordhaus-Gaddum type, Extrema of graph eigenvalues, Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph, Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type, Nordhaus-Gaddum relations for proximity and remoteness in graphs, Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues, The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix, Ramsey games with giants, Open problems on graph eigenvalues studied with AutoGraphiX, Eigenvalues of thek-th power of a graph, On a conjecture of V. Nikiforov
Cites Work
- Eigenvalues and degree deviation in graphs
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius and the genus of graphs
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Some Inequalities for the Largest Eigenvalue of a Graph
- Matrix Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item