Circulant graphs: efficient recognizing and isomorphism testing

DOI10.1016/j.endm.2005.06.002zbMath1137.05314OpenAlexW88126670MaRDI QIDQ3439301

Sergei Evdokimov, Ilya Nikolaevich 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

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

Related Items (1)

Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
• 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 the isomorphism problem for cyclic combinatorial objects
• Recognizing circulant graphs of prime order in polynomial time
• Coherent configurations. I
• On Schur rings over cyclic groups. II
• Some NP-Complete Problems Similar to Graph Isomorphism
• A solution of the isomorphism problem for circulant graphs
• Recognizing circulant graphs in polynomial time: An application of association schemes

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