TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2
Advances and Applications in Discrete Mathematics · 2025
DOI: 10.17654/0974165825025 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2025.
Abstract (Originalsprache)
For a nontrivial connected graph , a nonempty subset is a total offensive alliance in if is an offensive alliance and every vertex in has at least one neighbor within . The minimum cardinality of a total offensive alliance in is called the total offensive alliance number of , denoted by . In this paper, we investigate the total offensive alliance of total graphs generated from graphs with maximum degree 2 and present the characterization of total offensive alliance and their corresponding total offensive alliance number.
Zitieren
APA
(2025). TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2. Advances and Applications in Discrete Mathematics. https://doi.org/10.17654/0974165825025
Vancouver
TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2. Advances and Applications in Discrete Mathematics. 2025. doi:10.17654/0974165825025
BibTeX
@article{euvimed2025,
title = {TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2},
journal = {Advances and Applications in Discrete Mathematics},
year = {2025},
doi = {10.17654/0974165825025}
}
EUVIMED