Circulant graphs: efficient recognizing and isomorphism testing

DOI10.1016/J.ENDM.2005.06.002MaRDI QIDQ3439301zbMATH OpenOpenAlexFDO

Authors S. A. Evdokimov, Ilya Ponomarenko

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.002

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Geometric group theory (20F65)

Cites work

• A solution of the isomorphism problem for circulant graphs
• Coherent configurations. I
• scientific article; zbMATH DE number 2007658 (Why is no real title available?)
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• On Schur rings over cyclic groups. II
• On the isomorphism problem for cyclic combinatorial objects
• Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
• Recognizing circulant graphs in polynomial time: An application of association schemes
• Recognizing circulant graphs of prime order in polynomial time
• Recognizing recursive circulant graphs (extended abstract)
• Some NP-Complete Problems Similar to Graph Isomorphism
• The isomorphism problem for circulant graphs via Schur ring theory

Cited in

(3)

• Isomorphism testing for circulant graphs C_n (a, b)
• Recognizing and testing isomorphism of Cayley graphs over an abelian group of order \(4p\) in polynomial time
• scientific article; zbMATH DE number 6829367 (Why is no real title available?)

This page was built for publication: Circulant graphs: efficient recognizing and isomorphism testing

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