Sabidussi's Theorem
Statement
An (unlabeled and uncolored) directed graph is a Cayley graph of a group if and only if it admits a simply transitive action of by graph automorphisms (i.e., preserving the set of directed edges).
Further reading
- Wikipedia, page 358277, revision 1363694726, Cayley graph, section Characterization. adopted
About this page
| Tag | W76DE2EQCY |
|---|---|
| URI | m2://W76DE2EQCY |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 05C25, 20F65 |
| Status | This copy of the site has no build data. Run m2 status W76DE2EQCY. |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.