The isomorphism problem for circulant graphs via Schur ring theory

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Codes and Association Schemes

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1090/dimacs/056/19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Group Theory

  2007cited by this paper
• On Finite Groups with the Cayley Isomorphism Property, II

  1999cited by this paper
• Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. III. Graph Invariants and

  1999cited by this paper
• The Structure of Schur Rings Over Cyclic Groups of Square-Free Order

  1998cited by this paper
• On schur rings over cyclic groups

  1998cited by this paper
• Recognizing Circulant Graphs of Prime Order in Polynomial Time

  1998cited by this paper
• Analytical Enumeration of Circulant Graphs with Prime-Squared Number of Vertices

  1996cited by this paper
• The equivalence of two cyclic objects on pq elements

  1996cited by this paper
• The finite groups with the 2-dci property

  1996cited by this paper
• On Schur Rings over Cyclic Groups, II

  1996cited by this paper
• Ádám's Conjecture is True in the Square-Free Case

  1995cited by this paper
• The isomorphism problem for Cayley digraphs on groups of prime-squared order

  1995cited by this paper
• On the Structure of Basic Sets of Schur Rings over Cyclic Groups

  1994cited by this paper
• Computing the Diameter in Multiple-Loop Networks

  1993cited by this paper
• The Structure of Rational Schur Rings over Cyclic Groups

  1993cited by this paper
• Character Tables of Fission Schemes and Fusion Schemes

  1993cited by this paper
• Multipliers and Generalized Multipliers of Cyclic Objects and Cyclic Codes

  1993cited by this paper
• Algebraic structure of Schur rings

  1993cited by this paper
• Quasi-random subsets of Z n

  1992cited by this paper
• Processor Interconnection Networks from Cayley Graphs

  1992cited by this paper
• For computations with coherent configurations

  1991cited by this paper
• Galois correspondence between permutation groups and cellular rings (association schemes)

  1990cited by this paper
• The structure of Schur rings over cyclic groups

  1990cited by this paper
• On digraphs with circulant adjacency matrices

  1990cited by this paper
• An Optimization Problem in Distributed Loop Computer Networks

  1989cited by this paper
• Distance Regular Graphs

  1989cited by this paper
• Isomorphism Problem for Relational Structures with a Cyclic Automorphism

  1987cited by this paper
• The Diameter of undirected graphs associated to plane tessellations

  1985cited by this paper
• Reliable circulant networks with minimum transmission delay

  1985cited by this paper
• Algebraic Combinatorics I: Association Schemes

  1984cited by this paper
• Rational G-Matrices with Rational Eigenvalues

  1982cited by this paper
• On the full automorphism group of a graph

  1981cited by this paper
• Regular schemes over a finite Abelian group

  1979cited by this paper
• Isomorphism of circulant graphs and digraphs

  1979cited by this paper
• The König problem, the isomorphism problem for cyclic graphs and the characterization of Schur rings

  1978cited by this paper
• A note on Ádám's conjecture

  1977cited by this paper
• Isomorphism problem for a class of point-symmetric structures

  1977cited by this paper
• Untersuchungen von S‐Ringen, insbesondere im Gruppenring von p‐Gruppen

  1974cited by this paper
• On a type of circulants

  1973cited by this paper
• Isomorphism problem for a special class of graphs

  1970cited by this paper
• Graphs with circulant adjacency matrices

  1970cited by this paper
• Permutation groups through invariant relations and invariant functions

  1969cited by this paper
• A generalization of conjugacy in groups

  1968cited by this paper
• A generalization of the coset decomposition of a finite group.

  1965cited by this paper
• Finite Permutation Groups

  1964cited by this paper

• The Hamilton-Waterloo problem for triangle-factors and Hamiltonian cycles solved

  2026cites this paper
• Neumaier graphs from cyclotomy with small coherent rank

  2025cites this paper
• A lower bound for the Weisfeiler-Leman dimension of circulant graphs

  2025cites this paper
• 3-manifold polynomials

  2025influential citation
• New classes of groups related to algebraic combinatorics with applications to isomorphism problems

  2023influential citation
• Towards inductive proofs in algebraic combinatorics

  2023cites this paper
• Canonization of a random circulant graph by counting walks

  2023cites this paper
• How to Distinguish Cospectral Graphs

  2022cites this paper
• On the decomposition of circulant graphs using algorithmic approaches

  2022cites this paper
• On WL-rank of Deza Cayley graphs

  2021cites this paper
• Arc transitive circulants

  2021cites this paper
• On a Huge Family of Non-Schurian Schur Rings

  2021cites this paper
• Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs

  2021cites this paper
• On association schemes with multiplicities 1 or 2

  2021cites this paper
• On Automorphisms of the Double Cover of a Circulant Graph

  2021cites this paper
• The Weisfeiler-Leman Algorithm and Recognition of Graph Properties

  2020cites this paper
• S-Rings, Gelfand Pairs and Association Schemes

  2019cites this paper
• Schur ring and Codes for S-subgroups over Z2n

  2019cites this paper
• An explicit characterization of arc-transitive circulants

  2019cites this paper
• Fusion and Supercharacters

  2019cites this paper
• Schur Ring, Run Structure and Periodic Compatible Binary Sequences

  2018cites this paper
• Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory

  2018influential citation
• Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory

  2017cites this paper
• On the Enumeration of Circulant Graphs of Prime-Power Order: the case of $p^3$

  2017influential citation
• Dioid partitions of groups

  2017cites this paper
• A Note on the Isomorphism Problem for Monomial Digraphs

  2017cites this paper
• From Arithmetic to Zeta-Functions : Number Theory in Memory of Wolfgang Schwarz

  2016cites this paper
• Cycle Kronecker products that are representable as optimal circulants

  2015cites this paper
• Commutative Schur Rings of Maximal Dimension

  2015cites this paper
• Rotational circulant graphs

  2013influential citation
• Generalized Recursive Circulant Graphs

  2012cites this paper
• Automorphism Groups of Rational Circulant Graphs

  2012cites this paper
• Links between two semisymmetric graphs on 112 vertices through the lens of association schemes

  2011cites this paper
• Decomposition of skew-morphisms of cyclic

  2011cites this paper
• A construction of the automorphism groups of indecomposable S-rings over $${Z_{2^n}}$$

  2011cites this paper
• Decomposition of skew-morphisms of cyclic groups

  2011cites this paper
• Automorphism groups of rational circulant graphs through the use of Schur rings

  2010cites this paper
• Schur rings

  2009cites this paper
• Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics

  2009cites this paper
• Common circulant homogeneous factorisations of the complete digraph

  2009cites this paper
• Fusions of Character Tables and Schur Rings of Abelian Groups

  2008cites this paper
• Extended Petersen graphs

  2005cites this paper
• Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract)

  2005cites this paper
• Semidirect Products of Association Schemes

  2005cites this paper
• Automorphism Groups of Circulant Graphs — a Survey

  2004cites this paper
• Classifying Arc-Transitive Circulants

  2004cites this paper
• A Solution of the Isomorphism Problem for Circulant Graphs

  2004cites this paper
• Circulant graphs: recognizing and isomorphism testing in polynomial time

  2004cites this paper
• An Elementary Abelian Group of Large rank is not a CI-group

  2003cites this paper
• Enumeration of Cayley graphs and digraph

  2002cites this paper
• Toida's Conjecture is True

  2002cites this paper
• Enumeration ofCayley graphs and digraphs

  2002cites this paper
• On automorphisms of circulant digraphs on pm vertices, p an odd prime

  2002cites this paper
• Toida ' s conjecture is true Dobson

  year unknowncites this paper
• Edward 2002 Toida ' s conjecture is true

  year unknowncites this paper