Recognizing circulant graphs of prime order in polynomial time

zbMath0901.05053MaRDI QIDQ1386147

Gottfried Tinhofer, Mikhail E. Muzychuk

Publication date: 13 May 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119615

zbMATH Keywords

circulant graphrecognition algorithmcyclic association scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Searching for (near) Optimal Codes ⋮ Symmetry properties of chordal rings of degree 3 ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ Unnamed Item ⋮ On automorphism groups of circulant digraphs of square-free order ⋮ Circulant graphs: efficient recognizing and isomorphism testing

This page was built for publication: Recognizing circulant graphs of prime order in polynomial time