Trees with unique minimum glolal offensive alliance sets
Mohamed Bouzefrane, Isma Bouchemakh, Mohamed Zamime, Noureddine, Ikhlef-Eschouf

TL;DR
This paper characterizes trees that have a unique minimum global offensive alliance set, providing insights into the structure and properties of such trees within graph theory.
Contribution
It offers a constructive characterization of trees with a unique minimum global offensive alliance, a novel contribution to the study of offensive alliances in graphs.
Findings
Identifies structural properties of trees with unique minimum global offensive alliances
Provides a constructive method to characterize such trees
Enhances understanding of offensive alliance sets in tree graphs
Abstract
Let be a simple graph.\ A non-empty set is called a global offensive alliance if is a dominating set and for every vertex in , at least half of the vertices from the closed neighborhood of are in . The global offensive alliance number is the minimum cardinality of a global offensive alliance in . In this paper, we give a constructive characterization of trees having a unique minimum global offensive alliance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research
