Representation of deterministic graphs by defining pair of words
Saved in:
| Date: | 2022 |
|---|---|
| Main Authors: | O. S. Senchenko, M. I. Prytula, O. A. Sereda |
| Format: | Article |
| Language: | English |
| Published: |
2022
|
| Series: | Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001421113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
The presentation of deterministic and strongly deterministic graphs
by: Senchenko, O. S., et al.
Published: (2024) -
Metric properties of the canonical defining pair for determined graphs
by: S. V. Sapunov, et al.
Published: (2020) -
Linguistic representation of vertex-labeled graphs
by: S. V. Sapunov, et al.
Published: (2019) -
Collectives of automata on infinite grid graph with deterministic vertex labeling
by: S. V. Sapunov
Published: (2019) -
Bipartite graphs and best proximity pairs
by: K. Chaira, et al.
Published: (2022)