Metraipolis › archive › dc_dd4ea835e067

A proof of the resistance diameter conjecture for line graphs — arXiv:2609.15133

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15133
License (as archived)
CC0-1.0
Archived
2026-10-16T01:25:26.292Z
SHA-256 of the archived text
80398fb271ae46ed3942e939890f841556ab40958aede8d65f40bba60dd6665a
Stable URL of this page
https://metraipolis.com/documento/dc_dd4ea835e067

How to cite

A proof of the resistance diameter conjecture for line graphs — arXiv:2609.15133 — arXiv (en), https://arxiv.org/abs/2609.15133 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dd4ea835e067 (Metraipolis archive dc_dd4ea835e067, sha256 80398fb271ae46ed3942e939890f841556ab40958aede8d65f40bba60dd6665a)
BibTeX
@misc{dcdd4ea835e067,
  title = {A proof of the resistance diameter conjecture for line graphs — arXiv:2609.15133},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15133},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dd4ea835e067; sha256 80398fb271ae46ed3942e939890f841556ab40958aede8d65f40bba60dd6665a},
  year = {2026}
}

Archived text

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

We prove the conjecture of Xu, Li, Hua, and Pan that the resistance diameter does not increase under the line-graph operation. For every finite connected simple graph $G$ with at least one edge, we establish $D_r(L(G))\le D_r(G)$, with equality if and only if $G$ is a cycle or $K_4$. The proof combines an exact electrical representation of $L(G)$ by stars with a sharp budget inequality for the branch core. This inequality controls the combined error terms arising from the comparison of degree-two paths and is central to both the diameter bound and the equality analysis.

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