On the global offensive alliance in unicycle graphs
For a graph , a set is a dominating set if every vertex in has at least a neighbor in . A dominating set is a global offensive alliance if for each vertex in at least half the vertices from the closed neighborhood of are in The domination number is the minimum cardinality of a dominating set of , an...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.001 |