The presentation of deterministic and strongly deterministic graphs

DOI10.12958/ADM2157MaRDI QIDQ6561526zbMATH OpenFDO

Authors O. S. Senchenko, M. I. Prytula

Publication date 25 June 2024

Published in Algebra and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

presentationdefining pairdeterministic graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Certain congruences on free trioids
• Computational principles of mobile robotics.
• Domination on the vertices of labeled graphs
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Graph theory
• Handbook of weighted automata
• Linguistic representation of vertex-labeled graphs
• Process algebras for Petri nets. The alphabetization of distributed systems
• Properties of systems of defining relations for automata
• Representations of ordered doppelsemigroups by binary relations
• The monoid of endomorphisms of disconnected hypergraphs.

This page was built for publication: The presentation of deterministic and strongly deterministic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561526)