EUVIMEDEUVIMED entdecken
Crossref

The presentation of deterministic and strongly deterministic graphs

Oleksii Senchenko, Mykola Prytula

Algebra and Discrete Mathematics · 2023 · 36 (2) · 225-242

DOI: 10.12958/adm2157 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algebra and Discrete Mathematics, 2023. Verfasst von Oleksii Senchenko und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 13 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Senchenko, O., & Prytula, M. (2023). The presentation of deterministic and strongly deterministic graphs. Algebra and Discrete Mathematics, 36(2), 225-242. https://doi.org/10.12958/adm2157

Vancouver

Senchenko O, Prytula M. The presentation of deterministic and strongly deterministic graphs. Algebra and Discrete Mathematics. 2023;36(2):225-242. doi:10.12958/adm2157

BibTeX
@article{Senchenko2023,
  author = {Senchenko, Oleksii and Prytula, Mykola},
  title = {The presentation of deterministic and strongly deterministic graphs},
  journal = {Algebra and Discrete Mathematics},
  year = {2023},
  volume = {36},
  number = {2},
  pages = {225--242},
  doi = {10.12958/adm2157}
}
Infokarte | EUVIMED

Artikeldaten derzeit nicht verfügbar.

Recherche