| Autor: |
Vladimir Dimitrov Samodivkin |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
Electronic Journal of Graph Theory and Applications, Vol 6, Iss 1, Pp 1-16 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
2338-2287 |
| DOI: |
10.5614/ejgta.2018.6.1.1 |
| Popis: |
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the inequality b(G) ≤ 2s − 2, provided G has degree s vertices. We also present upper bounds for the bondage number of graphs in terms of the girth, domination number and Euler characteristic. As a corollary we give a stronger bound than the known constant upper bounds for the bondage number of graphs having domination number at least four. Several unanswered questions are posed. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
