TOTAL DEFENSIVE ALLIANCES IN GRAPHS
Far East Journal of Mathematical Sciences (FJMS) · 22.05.2026 · 143 (6) · 1839-1857
DOI: 10.17654/0972087126107 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 22.05.2026. Verfasst von Reymark S. Oñate und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Alliances in graphs model collective support among vertices. A total defensive alliance is a defensive alliance in which every vertex has a neighbor within the alliance. We determine the total defensive alliance number $a_{td}(G)$ for several classical graph families and characterize the structure of minimum total defensive alliances. For the join $G \vee H$ and the corona $G \circ H$, we derive degree threshold conditions that completely describe the total defensive alliances. As an application, we obtain sharp Nordhaus-Gaddum type bounds for $a_{td}(G) + a_{td}(\bar{G})$ when both $G$ and $\bar{G}$ are connected.
Zitieren
APA
Oñate, R. S., Cabahug, I. S., & Jr. (2026). TOTAL DEFENSIVE ALLIANCES IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(6), 1839-1857. https://doi.org/10.17654/0972087126107
Vancouver
Oñate RS, Cabahug IS, Jr.. TOTAL DEFENSIVE ALLIANCES IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(6):1839-1857. doi:10.17654/0972087126107
BibTeX
@article{Oate2026,
author = {Oñate, Reymark S. and Cabahug, Isagani S. and Jr.},
title = {TOTAL DEFENSIVE ALLIANCES IN GRAPHS},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2026},
volume = {143},
number = {6},
pages = {1839--1857},
doi = {10.17654/0972087126107}
}
EUVIMED