The presentation of deterministic and strongly deterministic graphs
The paper proposes a presentation of D-graphs and SD-graphs by a defining pair of words in the alphabet of their vertex labels. We present an algorithm that, given an arbitrary pair of sets, either constructs a D-graph for which this pair is the defining pair or informs that it is impossible to do s...
Збережено в:
| Дата: | 2024 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2024
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2157 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |