Metraipolis › archive › dc_cc406ceb5913

Positive Square Energy of Graphs with Minimum Degree at Least Two — arXiv:2609.06778

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06778
License (as archived)
CC0-1.0
Archived
2026-10-16T14:48:40.108Z
SHA-256 of the archived text
15bbbc04c659c75acc2b3978a972398e36ada2c3d9f0c25150a17069d6b4a93e
Stable URL of this page
https://metraipolis.com/documento/dc_cc406ceb5913

How to cite

Positive Square Energy of Graphs with Minimum Degree at Least Two — arXiv:2609.06778 — arXiv (en), https://arxiv.org/abs/2609.06778 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cc406ceb5913 (Metraipolis archive dc_cc406ceb5913, sha256 15bbbc04c659c75acc2b3978a972398e36ada2c3d9f0c25150a17069d6b4a93e)
BibTeX
@misc{dccc406ceb5913,
  title = {Positive Square Energy of Graphs with Minimum Degree at Least Two — arXiv:2609.06778},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06778},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cc406ceb5913; sha256 15bbbc04c659c75acc2b3978a972398e36ada2c3d9f0c25150a17069d6b4a93e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06778. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $s^+(G)$ denote the sum of the squares of the positive adjacency eigenvalues of a graph $G$. The square-energy conjecture of Elphick, Farber, Goldberg, and Wocjan, proved by Liu, Tang, and Zhang, gives a lower bound of $n-1$ for any connected graph of order $n$. We strengthen this bound to $s^+(G)\ge n$ for every connected graph $G$ of order $n$ with minimum degree at least two, unless $G$ is a cycle.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.06778 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.804Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).