Metraipolis › archive › dc_0f1afa389bcb

Independence number, essential connectivity and the distance spectral radius of graphs — arXiv:2609.37981

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37981
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:52.240Z
SHA-256 of the archived text
a60ecbd1ce2d4a1e6a3ca7a44ea6af4f22c713a9a0a76e23b04ea1facb3cc419
Stable URL of this page
https://metraipolis.com/documento/dc_0f1afa389bcb

How to cite

Independence number, essential connectivity and the distance spectral radius of graphs — arXiv:2609.37981 — arXiv (en), https://arxiv.org/abs/2609.37981 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0f1afa389bcb (Metraipolis archive dc_0f1afa389bcb, sha256 a60ecbd1ce2d4a1e6a3ca7a44ea6af4f22c713a9a0a76e23b04ea1facb3cc419)
BibTeX
@misc{dc0f1afa389bcb,
  title = {Independence number, essential connectivity and the distance spectral radius of graphs — arXiv:2609.37981},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37981},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0f1afa389bcb; sha256 a60ecbd1ce2d4a1e6a3ca7a44ea6af4f22c713a9a0a76e23b04ea1facb3cc419},
  year = {2026}
}

Archived text

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

An independent set of a graph G is a subset of VG, no two of which are adjacent. The cardinality of a maximum independent set in a graph G is called the independence number of G, denoted by alpha(G). The essential connectivity kappa'(G) of a graph G is denoted as the minimum number of vertices of G whose removal produces a disconnected graph with at least two non-trivial components. In this paper, we determine the n-vertex connected graphs with given independence number and essential connectivity that attain the minimum distance spectral radius, and fully characterize the corresponding extremal graphs.

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