Abstract
Let G = (V, E) be a simple graph. A non-empty set D ⊆ V is called a global offensive alliance if D is a dominating set and for every vertex ν in V − D, |NG [ν] ∩ D|≥|NG [ν] − D|. The global offensive alliance number is the minimum cardinality of a global offensive alliance in G. In this paper, we give a constructive characterization of trees having a unique minimum global offensive alliance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
