TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2
Maxene S. Hablo, Isagani S. Cabahug Jr. · Advances and Applications in Discrete Mathematics · 2025
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.