Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
From MaRDI portal
Publication:2013183
DOI10.1016/j.laa.2017.05.013zbMath1367.05127arXiv1607.08258OpenAlexW2963702568MaRDI QIDQ2013183
Clive Elphick, Mustapha Aouchiche
Publication date: 3 August 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.08258
Related Items
Some Nordhaus-Gaddum type results of \(A_\alpha \)-eigenvalues of weighted graphs, Graph Limits and Spectral Extremal Problems for Graphs, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjectured bounds for the sum of squares of positive eigenvalues of a graph
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Upper bounds for the achromatic and coloring numbers of a graph
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Open problems on graph eigenvalues studied with AutoGraphiX
- Proof of a conjectured lower bound on the chromatic number of a graph
- Eigenvalue problems of Nordhaus--Gaddum type
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- On a conjecture of V. Nikiforov
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- A bound on the spectral radius of graphs with \(e\) edges
- A survey of Nordhaus-Gaddum type relations
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Proof of a conjecture of V. Nikiforov
- Maximum norms of graphs and matrices, and their complements
- Some Inequalities for the Largest Eigenvalue of a Graph
- On Complementary Graphs
- Upper Bounds on the Order of a Clique of a Graph
