Metraipolis › archive › dc_a264aa5d3c2d

An infinite family of graphs with Šoltés fraction uniformly above one half — arXiv:2611.01808

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01808
License (as archived)
CC0-1.0
Archived
2026-11-03T11:37:25.583Z
SHA-256 of the archived text
05a49734b2439b36dc9fee213e2dc67b89238b3eec8e46cdac5a3280d139a619
Stable URL of this page
https://metraipolis.com/documento/dc_a264aa5d3c2d

How to cite

An infinite family of graphs with Šoltés fraction uniformly above one half — arXiv:2611.01808 — arXiv (en), https://arxiv.org/abs/2611.01808 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a264aa5d3c2d (Metraipolis archive dc_a264aa5d3c2d, sha256 05a49734b2439b36dc9fee213e2dc67b89238b3eec8e46cdac5a3280d139a619)
BibTeX
@misc{dca264aa5d3c2d,
  title = {An infinite family of graphs with Šoltés fraction uniformly above one half — arXiv:2611.01808},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01808},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a264aa5d3c2d; sha256 05a49734b2439b36dc9fee213e2dc67b89238b3eec8e46cdac5a3280d139a619},
  year = {2026}
}

Archived text

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

The Wiener index $W(G)$ of a connected graph $G$ is the sum of the distances between all unordered pairs of vertices. A vertex $x$ is a Šoltés vertex if $G-x$ is connected and $W(G-x)=W(G)$. We construct an infinite family of graphs in which the proportion of Šoltés vertices is strictly greater than $(\sqrt{21}-3)/3=0.5275\ldots>1/2$ and decreases to this value from $2/3$. The family is also described by a generalized Pell equation and starts from a $12$-vertex example of Akhmejanova et al. (Discrete Appl. Math. 325 (2023) 37-42). We also show that the construction remains valid after adding edges among certain vertices.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01808 — 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-11-03T11:05:22.282Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).