Recognizing circulant graphs of prime order in polynomial time

MaRDI QIDQ1386147zbMATH OpenFDO

Authors Gottfried Tinhofer, Mikhail 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, http://www.emis.de/journals/EJC/Volume_5/Abstracts/v5i1r25.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

circulant graphrecognition algorithmcyclic association scheme

Mathematics Subject Classification ID

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

Recommendations

• Recognizing circulant graphs in polynomial time: An application of association schemes
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• A solution of the isomorphism problem for circulant graphs

Cited in

(16)

• Powers of cycles, powers of paths, and distance graphs
• Recognizing circulant graphs in polynomial time: An application of association schemes
• Symmetry properties of chordal rings of degree 3
• Circulant graphs: efficient recognizing and isomorphism testing
• On automorphism groups of circulant digraphs of square-free order
• Combinatorial refinement on circulant graphs
• The Weisfeiler-Leman algorithm and recognition of graph properties
• Searching for (near) optimal codes
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences
• Colouring clique-hypergraphs of circulant graphs
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Finding the automorphism group of a circulant association scheme in polynomial time
• Recognizing hyperelliptic graphs in polynomial time
• The Weisfeiler-Leman algorithm and recognition of graph properties
• On the WL-dimension of circulant graphs of prime power order

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386147)