2018/04/19 by Mohamed Bouzefrane, Bouzefrane, Mohamed, Isma Bouchemakh +5
Computer Science · Mathematics · #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C69
paper · pdf · doi:10.48550/arxiv.1804.07113
arxiv created 2018/04/19 · openalex publication_date 2018/04/19 · arxiv updated 2018/04/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let G= ( V,E) be a simple graph. A non-empty set S ⊆ V is called a global offensive alliance if S is a dominating set and for every vertex v in V-S, at least half of the vertices from the closed neighborhood of v are in S. 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.