Metraipolis › archive › dc_e1ef5030d223
Classification of strictly resistance nonnegative graphs — arXiv:2609.23394
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23394
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:48.839Z
- SHA-256 of the archived text
3c397e21226b09d38b2b94b0a8b4ff980bdd533d5c90639d3ee5b0ac52fbab5e- Stable URL of this page
https://metraipolis.com/documento/dc_e1ef5030d223
How to cite
Classification of strictly resistance nonnegative graphs — arXiv:2609.23394 — arXiv (en), https://arxiv.org/abs/2609.23394 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e1ef5030d223 (Metraipolis archive dc_e1ef5030d223, sha256 3c397e21226b09d38b2b94b0a8b4ff980bdd533d5c90639d3ee5b0ac52fbab5e)
BibTeX
@misc{dce1ef5030d223,
title = {Classification of strictly resistance nonnegative graphs — arXiv:2609.23394},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23394},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e1ef5030d223; sha256 3c397e21226b09d38b2b94b0a8b4ff980bdd533d5c90639d3ee5b0ac52fbab5e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23394. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We say that a graph is resistance nonnegative or RN if it admits a positive edge-weight that yields nonnegative resistance curvature in the sense of Devriendt and Lambiotte. Analogously, a graph may be resistance positive or RP; we say a graph is strictly RN if it is RN but not RP. In this paper, we show that every $2$-connected strictly RN graph is bipartite with parts whose sizes differ by one, demonstrating that there are no $1$-tough strictly RN graphs. As a consequence, we prove that every $1$-tough RN graph is also RP. Lastly, we quantify the exact toughness values an RN graph can attain below $1$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.23394 — 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-09T21:26:41.117Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).