Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly self-ordered if the size of the symmetric difference between $E$...
Saved in:
| Published in: | TheoretiCS Vol. 1 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
TheoretiCS Foundation e.V
21.12.2022
|
| Subjects: | |
| ISSN: | 2751-4838, 2751-4838 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!