EUVIMEDEUVIMED entdecken
Crossref

The k‐Radius of 2‐Connected Graphs

Peter Dankelmann, Paul Horn

Journal of Graph Theory · 2026-10 · 113 (2) · 286-310

DOI: 10.1002/jgt.70065 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 19.05.2026. Verfasst von Peter Dankelmann und 1 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let be a connected graph. If is a set of vertices of , and is a vertex of , then the distance is the distance between and a vertex of closest to . The eccentricity of is defined as . For , the ‐radius of is defined as the smallest eccentricity of a set of vertices of . The ‐radius is, in some sense, a dual to the ‐distance domination number of , defined as the minimum cardinality of a set of vertices of such that every vertex not in is within distance of some vertex in . We prove that the ‐radius of a 2‐connected graph of order is at most . We also extend the well‐known result that the vertex set of a 2‐connected graph can be partitioned into two subsets of prescribed order, each inducing a connected subgraph. We prove that if we allow a small overlap between the sets, then the vertex set of a 2‐connected graph can be expressed as the union of three subsets of prescribed order, each inducing a connected subgraph.

Förderung

  • National Science Foundation

Zitieren

APA

Dankelmann, P., & Horn, P. (2026). The k‐Radius of 2‐Connected Graphs. Journal of Graph Theory, 113(2), 286-310. https://doi.org/10.1002/jgt.70065

Vancouver

Dankelmann P, Horn P. The k‐Radius of 2‐Connected Graphs. Journal of Graph Theory. 2026;113(2):286-310. doi:10.1002/jgt.70065

BibTeX
@article{Dankelmann2026,
  author = {Dankelmann, Peter and Horn, Paul},
  title = {The k‐Radius of 2‐Connected Graphs},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {113},
  number = {2},
  pages = {286--310},
  doi = {10.1002/jgt.70065}
}
Kostenlos starten →