The $k$-Total Bondage Number of a Graph
Theory and Applications of Graphs · 11.06.2026
DOI: 10.20429/tag.2026.130103 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory and Applications of Graphs, online erschienen am 11.06.2026. Verfasst von Jean-Pierre Appel und 4 weiteren Autor:innen.
Abstract (Originalsprache)
Let $G=(V,E)$ be a connected, finite undirected graph. A set $S \subseteq V$ is said to be a total dominating set of $G$ if every vertex in $V$ is adjacent to some vertex in $S$. The total domination number, $\gamma_{t}(G)$, is the minimum cardinality of a total dominating set in $G$. We define the $k$-total bondage of $G$ to be the minimum number of edges to remove from $G$ so that the resulting graph has a total domination number at least $k$ more than $\gamma_{t}(G)$. We establish general properties of $k$-total bondage and find exact values for certain graph classes including paths, cycles, wheels, complete and complete bipartite graphs.
Zitieren
APA
Appel, J., Fischberg, G., Kelley, K., Shank, N. B., & Sosis, E. (2026). The $k$-Total Bondage Number of a Graph. Theory and Applications of Graphs. https://doi.org/10.20429/tag.2026.130103
Vancouver
Appel J, Fischberg G, Kelley K, Shank NB, Sosis E. The $k$-Total Bondage Number of a Graph. Theory and Applications of Graphs. 2026. doi:10.20429/tag.2026.130103
BibTeX
@article{Appel2026,
author = {Appel, Jean-Pierre and Fischberg, Gabrielle and Kelley, Kyle and Shank, Nathan B and Sosis, Eliel},
title = {The $k$-Total Bondage Number of a Graph},
journal = {Theory and Applications of Graphs},
year = {2026},
doi = {10.20429/tag.2026.130103}
}
EUVIMED