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...
Збережено в:
| Видавець: | Lugansk National Taras Shevchenko University |
|---|---|
| Дата: | 2024 |
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2024
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2157 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Організація
Algebra and Discrete Mathematics| id |
oai:ojs.admjournal.luguniv.edu.ua:article-2157 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-21572024-02-14T18:40:04Z The presentation of deterministic and strongly deterministic graphs Senchenko, O. S. Prytula, M. I. deterministic graph, presentation, defining pair 68R10, 05C62, 05C78. 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 so. We also present an algorithm for constructing a canonical defining pair for a D-graph and find some numerical estimates of this pair. Lugansk National Taras Shevchenko University The authors are partially supported by the Grant EFDS-FL2-08 of the found The European Federation of Academies of Sciences and Humanities (ALLEA) 2024-02-14 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2157 10.12958/adm2157 Algebra and Discrete Mathematics; Vol 36, No 2 (2023) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2157/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/2157/1113 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/2157/1114 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/2157/1115 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/2157/1116 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/2157/1117 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/2157/1118 Copyright (c) 2024 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| collection |
OJS |
| language |
English |
| topic |
deterministic graph presentation defining pair 68R10 05C62 05C78. |
| spellingShingle |
deterministic graph presentation defining pair 68R10 05C62 05C78. Senchenko, O. S. Prytula, M. I. The presentation of deterministic and strongly deterministic graphs |
| topic_facet |
deterministic graph presentation defining pair 68R10 05C62 05C78. |
| format |
Article |
| author |
Senchenko, O. S. Prytula, M. I. |
| author_facet |
Senchenko, O. S. Prytula, M. I. |
| author_sort |
Senchenko, O. S. |
| title |
The presentation of deterministic and strongly deterministic graphs |
| title_short |
The presentation of deterministic and strongly deterministic graphs |
| title_full |
The presentation of deterministic and strongly deterministic graphs |
| title_fullStr |
The presentation of deterministic and strongly deterministic graphs |
| title_full_unstemmed |
The presentation of deterministic and strongly deterministic graphs |
| title_sort |
presentation of deterministic and strongly deterministic graphs |
| description |
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 so. We also present an algorithm for constructing a canonical defining pair for a D-graph and find some numerical estimates of this pair. |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2024 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2157 |
| work_keys_str_mv |
AT senchenkoos thepresentationofdeterministicandstronglydeterministicgraphs AT prytulami thepresentationofdeterministicandstronglydeterministicgraphs AT senchenkoos presentationofdeterministicandstronglydeterministicgraphs AT prytulami presentationofdeterministicandstronglydeterministicgraphs |
| first_indexed |
2024-04-12T06:13:57Z |
| last_indexed |
2024-04-12T06:13:57Z |
| _version_ |
1804810508491030528 |