Domination on the vertices of labeled graphs
In this paper we introduce and study a domination relation on vertices of vertex-labeled graphs induced by vertex languages comparison. An effective method of checking this relation is developed. Properties of vertices maximal by this relation are investigated. It is shown that dominating vertices f...
Збережено в:
| Дата: | 2012 |
|---|---|
| Автори: | , , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2012
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/152237 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Domination on the vertices of labeled graphs / I. Grunsky, I. Mikhaylova, S. Sapunov // Algebra and Discrete Mathematics. — 2012. — Vol. 14, № 2. — С. 174–184. — Бібліогр.: 13 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | In this paper we introduce and study a domination relation on vertices of vertex-labeled graphs induced by vertex languages comparison. An effective method of checking this relation is developed. Properties of vertices maximal by this relation are investigated. It is shown that dominating vertices form a connected component of the graph. |
|---|