| Autor: |
Mohamed Bouzefrane, Saliha Ouatiki |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 72-78 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
0972-8600 |
| DOI: |
10.1016/j.akcej.2018.01.001 |
| Popis: |
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 , and the global offensive alliance number is the minimum cardinality of a global offensive alliance of . We show that if is a connected unicycle graph of order with leaves and support vertices then . Moreover, we characterize all extremal unicycle graphs attaining this bound. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
