A solution of the isomorphism problem for circulant graphs
From MaRDI portal
Publication:4460731
DOI10.1112/S0024611503014412zbMath1045.05052WikidataQ55982755 ScholiaQ55982755MaRDI QIDQ4460731
Publication date: 29 March 2004
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Isomorphism between circulants and Cartesian products of cycles ⋮ On automorphisms of the double cover of a circulant graph ⋮ Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time ⋮ Constructions of isospectral circulant graphs ⋮ Implementing quantum Fourier transform using three qubits ⋮ Greedy routing in circulant networks ⋮ On isomorphisms of vertex-transitive graphs ⋮ Cayley graphs of more than one abelian group ⋮ Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters ⋮ The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups ⋮ Eigenvalues of Cayley graphs ⋮ Design and serial construction of digraph braids ⋮ ON ISOMORPHISMS OF VERTEX-TRANSITIVE CUBIC GRAPHS ⋮ Structural properties of Toeplitz graphs ⋮ New families of circulant graphs without Cayley isomorphism property with \(r_i = 2\) ⋮ Two families of graphs that are Cayley on nonisomorphic groups ⋮ Clique complexes and graph powers ⋮ Four-dimensional almost Einstein manifolds with skew-circulant stuctures ⋮ Generalized dihedral CI-groups ⋮ Curvature properties of 4-dimensional Riemannian manifolds with a circulant structure ⋮ All normalized anti-monotonic overlap graph measures are bounded ⋮ Further restrictions on the structure of finite DCI-groups: an addendum ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Cubic bi-Cayley graphs over abelian groups ⋮ Graphs whose complement and square are isomorphic ⋮ Schur rings over a product of Galois rings ⋮ From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices ⋮ On Cayley representations of finite graphs over Abelian $p$-groups ⋮ The isomorphism problem for abelian projective planes ⋮ Testing set proportionality and the Ádám isomorphism of circulant graphs ⋮ On isomorphism between circulant and Cartesian product of 2 cycles ⋮ Monomial isomorphisms of cyclic codes ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ On Hamiltonian paths in distance graphs ⋮ The spectrum of semi-Cayley graphs over abelian groups ⋮ Automorphisms of endomorphism semigroups of reflexive digraphs ⋮ Testing isomorphism of circulant objects in polynomial time ⋮ Long cycles and paths in distance graphs ⋮ Schur rings over a Galois ring of odd characteristic ⋮ On the extendability of certain semi-Cayley graphs of finite Abelian groups ⋮ Finding a cycle base of a permutation group in polynomial time ⋮ Separability of Schur rings over abelian \(p\)-groups ⋮ On isomorphisms of circulant digraphs of bounded degree ⋮ One-matching bi-Cayley graphs over Abelian groups ⋮ The Travelling Salesman Problem in symmetric circulant matrices with two stripes ⋮ On WL-rank and WL-dimension of some Deza circulant graphs ⋮ Graphical representations of cyclic permutation groups ⋮ Splitting fields of spectra of circulant graphs ⋮ Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). ⋮ Recognizing generalized Sierpiński graphs ⋮ Permutation group approach to association schemes ⋮ Schur rings. ⋮ Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs ⋮ Circulant graphs: efficient recognizing and isomorphism testing
This page was built for publication: A solution of the isomorphism problem for circulant graphs
