For every graph, min{s+, s-} is at least 2m/chi_vec(G), resolving a conjecture of Wocjan, Elphick and Anekstein.
Symmetry and asymmetry between positive and negative square energies of graphs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The positive and negative square energies of a graph, $s^+(G)$ and $s^-(G)$, are the sums of squares of the positive and negative eigenvalues of the adjacency matrix, respectively. The first results on square energies revealed symmetry between $s^+(G)$ and $s^-(G)$. This paper reviews examples of asymmetry between these parameters, for example using large random graphs and the ratios $s^+/s^-$ and $s^-/s^+$, as well as new examples of symmetry. We answer some questions previously asked about $s^{+}$ and $s^{-}$ and suggest several further avenues of research.
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Conic programming to understand sums of squares of eigenvalues of graphs
For every graph, min{s+, s-} is at least 2m/chi_vec(G), resolving a conjecture of Wocjan, Elphick and Anekstein.