Recognizing circulant graphs in polynomial time: An application of association schemes

zbMath0996.05072MaRDI QIDQ5940668

Gottfried Tinhofer, Mikhail E. Muzychuk

Publication date: 13 August 2001

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

Full work available at URL: http://www.emis.de/journals/EJC/Volume_8/Abstracts/v8i1r26.html

zbMATH Keywords

automorphismSchur ringscirculant graphspolynomial recognition algorithm

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Powers of cycles, powers of paths, and distance graphs ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Minimum chromaticity of circulant graphs ⋮ Circulant graphs: efficient recognizing and isomorphism testing

This page was built for publication: Recognizing circulant graphs in polynomial time: An application of association schemes