The presentation of deterministic and strongly deterministic graphs

• Дата: 2024
• Автори: Senchenko, O. S., Prytula, M. I.
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2024
• Теми: deterministic graph; presentation; defining pair; 68R10; 05C62; 05C78.
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2157
• Назва журналу: Algebra and Discrete Mathematics

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...