On the global offensive alliance in unicycle graphs
Mohamed Bouzefrane, Saliha Ouatiki
AKCE International Journal of Graphs and Combinatorics · 2018
doi:10.1016/j.akcej.2018.01.001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
For a graph G = ( V, E ), a set S ⊆ V is a dominating set if every vertex in V − S has at least a neighbor in S. A dominating set S is a global offensive alliance if for each vertex v in V − S at least half the vertices from the closed neighborhood of v are in S. The domination number γ ( G ) is the minimum cardinality of a dominating set of G, and the global offensive alliance number γ o ( G ) is the minimum cardinality of a global offensive alliance of G. We show that if G is a connected unicycle graph of order n with l ( G ) leaves and s ( G ) support vertices then γ o ( G ) ≥ n − l ( G ) + s ( G ) 3. Moreover, we characterize all extremal unicycle graphs attaining this bound. Keywords: Domination, Global offensive alliance, Unicycle graph
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.