Global outer connected domination number of a graph

• Дата: 2018
• Автори: Alishahi, Morteza, Mojdeh, Doost Ali
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: global domination; outer connected domination; global outer connected domination; trees; 05C69
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/126
• Назва журналу: Algebra and Discrete Mathematics

For a given graph \(G=(V,E)\), a dominating set \(D \subseteq V(G)\) is said to be an outer connected dominating set if \(D=V(G)\) or \(G-D\) is connected. The outer connected domination number of a graph \(G\), denoted by \(\widetilde{\gamma}_c(G)\), is the cardinality of a minimum outer connected...