Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time
DOI10.1007/978-3-030-32808-5_7zbMath1442.05087arXiv1706.06145OpenAlexW3000491517MaRDI QIDQ3296729
Roman Nedela, Ilya Nikolaevich Ponomarenko
Publication date: 1 July 2020
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.06145
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite abelian groups (20K01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Symmetric groups (20B30)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Schur rings.
- 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
- On a new high dimensional Weisfeiler-Lehman algorithm
- Separability of Schur rings over abelian \(p\)-groups
- On Schur rings over infinite groups
- On Schurity of Finite Abelian Groups
- Schurity of $S$-rings over a cyclic group and generalized wreath product of permutation groups
- Circulant graphs: efficient recognizing and isomorphism testing
- Schemes of a finite projective plane and their extensions
- The Group is a CI-Group
- Isomorphism problem for a class of point-symmetric structures
- A NEW LOOK AT THE BURNSIDE–SCHUR THEOREM
This page was built for publication: Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time
