Total global neighbourhood domination
A subset \(D\) of the vertex set of a connected graph \(G\) is called a total global neighbourhood dominating set (\(\mathrm{tgnd}\)-set) of \(G\) if and only if \(D\) is a total dominating set of \(G\) as well as \(G^{N}\), where \(G^{N}\) is the neighbourhood graph of \(G\). The total global neigh...
Збережено в:
| Дата: | 2018 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2018
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/86 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |