Circulant graphs: recognizing and isomorphism testing in polynomial time
From MaRDI portal
Recommendations
- Recognizing circulant graphs in polynomial time: An application of association schemes
- Finding the automorphism group of a circulant association scheme in polynomial time
- Testing isomorphism of circulant objects in polynomial time
- Finding a cycle base of a permutation group in polynomial time
- A solution of the isomorphism problem for circulant graphs
Cites work
- A polynomial bound for the orders of primitive solvable groups
- Coherent configurations. I
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 2007658 (Why is no real title available?)
- scientific article; zbMATH DE number 3009780 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
- On a new high dimensional Weisfeiler-Lehman algorithm
- On isomorphisms of finite Cayley graphs---a survey
- On Schur rings over cyclic groups. II
- On the isomorphism problem for cyclic combinatorial objects
- On the structure of basic sets of Schur rings over cyclic groups
- 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
- Separability number and Schurity number of coherent configurations
- Some NP-Complete Problems Similar to Graph Isomorphism
- The isomorphism problem for circulant graphs via Schur ring theory
- Two inequalities for parameters of a cellular algebra
- Ádám's conjecture is true in the square-free case
Cited in
(46)- Permutation group approach to association schemes
- Schur rings.
- Polynomial time recognition and testing of isomorphism of cyclic tournaments
- Recognizing circulant graphs of prime order in polynomial time
- 3-connected reduction for regular graph covers
- Separability of Schur rings over abelian p-groups
- Testing isomorphism of circulant objects in polynomial time
- On WL-rank and WL-dimension of some Deza circulant graphs
- Hamiltonian problems in directed graphs with simple row patterns
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Isomorphism between circulants and Cartesian products of cycles
- Schur rings over a product of Galois rings
- On Cayley representations of central Cayley graphs over almost simple groups
- Isomorphism testing for circulant graphs C_n (a, b)
- A survey on undirected circulant graphs
- Finding the automorphism group of a circulant association scheme in polynomial time
- On the separability problem for circulant S-rings
- Recognizing and testing isomorphism of Cayley graphs over an abelian group of order \(4p\) in polynomial time
- scientific article; zbMATH DE number 3863441 (Why is no real title available?)
- Polynomial time recognition and isomorphism testing for cyclic tournaments
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- scientific article; zbMATH DE number 3933116 (Why is no real title available?)
- Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments
- A solution of the isomorphism problem for circulant graphs
- A family of permutation groups with exponentially many nonconjugated regular elementary abelian subgroups
- scientific article; zbMATH DE number 6829367 (Why is no real title available?)
- scientific article; zbMATH DE number 1420912 (Why is no real title available?)
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Powers of cycles, powers of paths, and distance graphs
- On Hamiltonian paths in distance graphs
- Recognizing hyperelliptic graphs in polynomial time
- The Weisfeiler-Leman algorithm and recognition of graph properties
- The Weisfeiler-Leman algorithm and recognition of graph properties
- Recognizing circulant graphs in polynomial time: An application of association schemes
- Cubic time recognition of cocircuit graphs of uniform oriented matroids
- On the WL-dimension of circulant graphs of prime power order
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
- Canonization of a random circulant graph by counting walks
- Combinatorial refinement on circulant graphs
- Testing isomorphism of circulant objects in polynomial time
- The Kirchhoff indices for circulant graphs
- Long cycles and paths in distance graphs
- Finding a cycle base of a permutation group in polynomial time
- A lower bound for the Weisfeiler-Leman dimension of circulant graphs
- Two-closures of supersolvable permutation groups in polynomial time
- Schur rings over a Galois ring of odd characteristic
This page was built for publication: Circulant graphs: recognizing and isomorphism testing in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675535)
