Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535)
From MaRDI portal
scientific article; zbMATH DE number 2165581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circulant graphs: recognizing and isomorphism testing in polynomial time |
scientific article; zbMATH DE number 2165581 |
Statements
Circulant graphs: recognizing and isomorphism testing in polynomial time (English)
0 references
4 May 2005
0 references
Regular cycle automorphism group
0 references
Cayley graph
0 references
polynomial-time algorithm
0 references
0 references
