Conjectured bounds for the sum of squares of positive eigenvalues of a graph

DOI10.1016/J.DISC.2016.01.021zbMATH Open1339.05228arXiv1409.2079OpenAlexW92141041MaRDI QIDQ297913FDOQ297913

Authors: Clive Elphick, Miriam Farber, Felix Goldberg, Pawel Wocjan 

Publication date: 20 June 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A well known upper bound for the spectral radius of a graph, due to Hong, is that $m{u}_1^{2}le2m-n+1$. It is conjectured that for connected graphs $n-1le{s}^{+}le2m-n+1$, where $s^{+}$ denotes the sum of the squares of the positive eigenvalues. The conjecture is proved for various classes of graphs, including bipartite, regular, complete $q$-partite, hyper-energetic, and barbell graphs. Various searches have found no counter-examples. The paper concludes with a brief discussion of the apparent difficulties of proving the conjecture in general.

Full work available at URL: https://arxiv.org/abs/1409.2079

Recommendations

• Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
• Positive and negative square energies of graphs
• On the sum of signless Laplacian eigenvalues of a graph
• Note on a conjecture for the sum of signless Laplacian eigenvalues.
• Upper bounds for the sum of Laplacian eigenvalues of graphs

zbMATH Keywords

adjacency matrixhyper-energetic graphsinertia of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Some Inequalities for the Largest Eigenvalue of a Graph
• The energy of graphs and matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• On graphs with a fixed number of negative eigenvalues
• A bound on the spectral radius of graphs
• Lower bound of the sum of positive eigenvalues of a graph
• Bounds of eigenvalues of graphs
• Graphs with Exactly Two Negative Eigenvalues
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• Proof of a conjectured lower bound on the chromatic number of a graph
• Lower bounds for the clique and the chromatic numbers of a graph

Cited In (9)

• Adjacency eigenvalues of graphs without short odd cycles
• Eigenvalues and triangles in graphs
• Two conjectured strengthenings of Turán's theorem
• Positive and negative square energies of graphs
• Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
• The estimation of the bound of the sum of squares of positive (negative) eigenvalues of a graph
• Symmetry and asymmetry between positive and negative square energies of graphs
• On borderenergetic graphs
• Upper bounds for the achromatic and coloring numbers of a graph

This page was built for publication: Conjectured bounds for the sum of squares of positive eigenvalues of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297913)