REVIEW 1 cited by
Symmetry and asymmetry between positive and negative square energies of graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.