The presentation of deterministic and strongly deterministic graphs-Reference-Cited by-同舟云学术

The presentation of deterministic and strongly deterministic graphs

Published:2023 Issue:2 Volume:36 Page:225-242
ISSN:1726-3255
Container-title:Algebra and Discrete Mathematics
language:
Short-container-title:ADM

Author:

,Senchenko Oleksii,Prytula Mykola,

Abstract

The paper proposes a presentation of D-graphsand 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 alsopresent an algorithm for constructing a canonical defining pair fora D-graph and find some numerical estimates of this pair.

Publisher

Luhansk Taras Shevchenko National University

Reference13 articles.

1. [1] U. Knauer, M. Nieporte,Endomorphisms of graphs I. The monoid ofstrong endomorphisms, Archiv der Mathematik,52, 1989, pp. 607-614.DOI: 10.1007/BF01237575.

2. [2] Y. V. Zhuchok,The monoid of endomorphisms of disconnected hypergraphs, Al-gebra and Discrete Mathematics,16(1), 2013, pp. 134-150. https://admjournal.luguniv.edu.ua/index.php/adm/article/view/763/292.

3. [3] J.-L. Loday, M. O. Ronco,Trialgebras and families of polytopes, ContemporaryMathematics,346, 2004, pp. 369-398. DOI: 10.48550/arXiv.math/0205043.

4. [4] A. V. Zhuchok, Yul. V. Zhuchok, Y. V. Zhuchok,Certain congruences on free tri-oids, Communications in Algebra,47(12), 2019, pp. 5471-5481. DOI: 10.1080/00927872.2019.1631322.

5. [5] Y. V. Zhuchok, J. Koppitz,Representations of ordered doppelsemigroups by bi-nary relations, Algebra and Discrete Mathematics,27(1), 2019, pp. 144-154.https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1294/pdf.