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$...
Uložené v:
| Vydané v: | TheoretiCS Ročník 1 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
TheoretiCS Foundation e.V
21.12.2022
|
| Predmet: | |
| ISSN: | 2751-4838, 2751-4838 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!