The presentation of deterministic and strongly deterministic graphs
Oleksii Senchenko,
Mykola Prytula
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.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.