On the monophonic global domination number of a graph
UDC 519.17 We introduce the monophonic global domination number $\overline{\gamma}_m(G)$ by combining monophonic convexity (via chordless paths) with the global domination in a graph and its complement. A monophonic global dominating set is defined, and $\overline{\gamma}_m(G)$ is regarded as the mi...
Збережено в:
| Дата: | 2026 |
|---|---|
| Автори: | , , |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Institute of Mathematics, NAS of Ukraine
2026
|
| Онлайн доступ: | https://umj.imath.kiev.ua/index.php/umj/article/view/7618 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Ukrains’kyi Matematychnyi Zhurnal |
Репозитарії
Ukrains’kyi Matematychnyi Zhurnal| Резюме: | UDC 519.17
We introduce the monophonic global domination number $\overline{\gamma}_m(G)$ by combining monophonic convexity (via chordless paths) with the global domination in a graph and its complement. A monophonic global dominating set is defined, and $\overline{\gamma}_m(G)$ is regarded as the minimum size of sets of this kind. We also establish the bounds, relate $\overline{\gamma}_m(G)$ to the classical domination number, and characterize the graphs that attain extreme values. The realization theorem is proved for prescribed parameter values. The behavior of $\overline{\gamma}_m(G)$ under graph operations, in particular, for the corona product, is analyzed. The applications to the network monitoring are discussed and several open problems are proposed for further research. |
|---|---|
| DOI: | 10.3842/umzh.v78i5-6.7618 |