EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Vertex and Mixed k-Diameter Component Connectivity

Adam Buzzard, Nathan Shank

Mathematics Exchange · 03.03.2026 · 16 (1) · 23-35

DOI: 10.33043/n7cf7h5m2c ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics Exchange, online erschienen am 03.03.2026. Verfasst von Adam Buzzard und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In the k-diameter component connectivity model a network is consider operational if there is a component with diameter at least k. Therefore, a network is in a failure state if every component has diameter less than k. In this paper we find the vertex variant of the k-diameter component connectivity parameter, which is the minimum number of vertex deletions in order to put a network into a failure state, for particular classes of graphs. We also show the mixed variant by allowing vertex and edge failures within the network. We show results for paths, cycles, complete, and complete bipartite graphs for both variants as well as perfect r-ary trees for the vertex variant.

Zitieren

APA

Buzzard, A., & Shank, N. (2026). Vertex and Mixed k-Diameter Component Connectivity. Mathematics Exchange, 16(1), 23-35. https://doi.org/10.33043/n7cf7h5m2c

Vancouver

Buzzard A, Shank N. Vertex and Mixed k-Diameter Component Connectivity. Mathematics Exchange. 2026;16(1):23-35. doi:10.33043/n7cf7h5m2c

BibTeX
@article{Buzzard2026,
  author = {Buzzard, Adam and Shank, Nathan},
  title = {Vertex and Mixed k-Diameter Component Connectivity},
  journal = {Mathematics Exchange},
  year = {2026},
  volume = {16},
  number = {1},
  pages = {23--35},
  doi = {10.33043/n7cf7h5m2c}
}
Kostenlos starten →