Metraipolis › archive › dc_e781d41bdea8

Rank-Average Degree Bound for Graph Energy — arXiv:2608.22139

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22139
License (as archived)
CC0-1.0
Archived
2026-10-18T08:29:58.516Z
SHA-256 of the archived text
93840d41d03c6bd1f7d9b3a1a90035b8ae8585281b67725d2c8e1b06d2cb158b
Stable URL of this page
https://metraipolis.com/documento/dc_e781d41bdea8

How to cite

Rank-Average Degree Bound for Graph Energy — arXiv:2608.22139 — arXiv (en), https://arxiv.org/abs/2608.22139 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e781d41bdea8 (Metraipolis archive dc_e781d41bdea8, sha256 93840d41d03c6bd1f7d9b3a1a90035b8ae8585281b67725d2c8e1b06d2cb158b)
BibTeX
@misc{dce781d41bdea8,
  title = {Rank-Average Degree Bound for Graph Energy — arXiv:2608.22139},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22139},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e781d41bdea8; sha256 93840d41d03c6bd1f7d9b3a1a90035b8ae8585281b67725d2c8e1b06d2cb158b},
  year = {2026}
}

Archived text

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

We prove that the energy ${\mathcal E}(G)$ of any simple graph $G$ of order $n\ge5$ satisfies \[ {\mathcal E}\ge r(G)+\bar d(G)-1, \] where $r(G)$ and $\bar d(G)$ denote, respectively, the rank of the adjacency matrix and the average degree of $G$. We also characterize all extremal graphs. As consequences, our result settles five previously conjectured lower bounds for the energy of nonsingular graphs in their stated ranges, namely \[ \begin{gathered} {\mathcal E}(G)\ge n-1+\bar d(G),\qquad {\mathcal E}(G)\ge\Delta(G)+\delta(G),\qquad {\mathcal E}(G)\ge2\sqrt{\bar d(G) (n-1)},\qquad {\mathcal E}(G)\ge\frac{M_1(G)}{m},\qquad {\mathcal E}(G)\ge\frac{M_1(G)}{2m}+\frac{2m}{n}, \end{gathered} \] where $m$ is the number of edges, $\Delta(G)$ and $\delta(G)$ are the maximum and minimum degrees, and the first Zagreb index $ M_1(G)$ is the sum of degree squares.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22139 — 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-18T08:27:54.398Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).