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$...
Gespeichert in:
| Veröffentlicht in: | TheoretiCS Jg. 1 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
TheoretiCS Foundation e.V
21.12.2022
|
| Schlagworte: | |
| ISSN: | 2751-4838, 2751-4838 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!