Conjectured bounds for the sum of squares of positive eigenvalues of a graph
Authors:
- Clive ElphickCEClive Elphick
- Miriam FarberMFMiriam Farber
- Felix GoldbergFGFelix Goldberg
- Pawel WocjanPWPawel Wocjan
- 1 September 2016
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (9) , 2215-2223
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (1122374)
This publication has 12 references indexed in Scilit:
- Proof of a conjectured lower bound on the chromatic number of a graphLinear Algebra and its Applications, 2015
- The energy of graphs and matricesJournal of Mathematical Analysis and Applications, 2007
- Some Inequalities for the Largest Eigenvalue of a GraphCombinatorics, Probability and Computing, 2002
- Lower bound of the sum of positive eigenvalues of a graphActa Mathematicae Applicatae Sinica, English Series, 1998
- Bounds of eigenvalues of graphsDiscrete Mathematics, 1993
- A bound on the spectral radius of graphsLinear Algebra and its Applications, 1988
- On graphs with a fixed number of negative eigenvaluesDiscrete Mathematics, 1985
- Lower bounds on the spectra of symmetric matrices with nonnegative entriesLinear Algebra and its Applications, 1985
- Lower bounds for the clique and the chromatic numbers of a graphDiscrete Applied Mathematics, 1983
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941