Strong defensive alliances on graph operators
Open Access
- 27 March 2026
- journal article
- research article
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (2) , 685-696
Abstract
If G = (V(G), E(G)) is a simple connected graph with vertex set V(G) and edge set E(G) , we say that a subset D ⊆ V(G) is a strong defensive alliance if for every vertex v ∈ D the condition δ D ( v ) ≥ δ D ̅ ( v ) holds. The strong defensive alliance number α(G) is defined as the minimum cardinality among all the strong defensive alliances. A unitary operator of graphs 𝒪 assigns to each graph G a graph 𝒪( G ). A few examples of unitary operators of graphs are: Subdivision S(G), R(G) , Middle Q(G) , Total T(G) , and Central 𝒞(G). In this paper we determine the exact values of α (S(G)) and α (R(G)) . We also characterize the graphs G for which the number of strong defensive alliances is 1, 2, or 3 in Q(G) and T(G) . We also we give tight bounds for α (S̅(G̅)) , α (Q(G)) , α (Q̅(G̅)) , α(T(G)) , and α(????(G)) .Keywords
This publication has 16 references indexed in Scilit:
- The differential on graph operator R(G)RAIRO - Operations Research, 2024
- Total Domination on Tree OperatorsMediterranean Journal of Mathematics, 2022
- Maximum Alliance-Free and Minimum Alliance-Cover Sets2022
- On the bondage number of middle graphsMathematical Notes, 2013
- On the complement graph and defensive -alliancesDiscrete Applied Mathematics, 2009
- Defensive -alliances in graphsApplied Mathematics Letters, 2009
- Global defensive -alliances in graphsDiscrete Applied Mathematics, 2009
- On defensive alliances and line graphsApplied Mathematics Letters, 2006
- An algorithm to recognize a middle graphDiscrete Applied Mathematics, 1984
- Traversability and connectivity of the middle graph of a graphDiscrete Mathematics, 1976