Toida's Conjecture is True

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Electronic Journal of Combinatorics

• Publication date

  2002-03-31

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.37236/1651
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On isomorphisms of finite Cayley graphs--a survey

  2002cited by this paper
• On the isomorphism problem for cyclic combinatorial objects

  1999influential reference
• The isomorphism problem for circulant graphs via Schur ring theory

  1999cited by this paper
• On Ádám's conjecture for circulant graphs

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

  1995cited by this paper
• Isomorphism problem for Cayley graphs of Zp3

  1995cited by this paper
• Isomorphisms of Cayley graphs. II

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

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

  1977cited by this paper
• Graph Theory with Applications

  1977cited by this paper
• Graphs with circulant adjacency matrices

  1970cited by this paper
• private communication

  1969cited by this paper
• Point-symmetric graphs with a prime number of points

  1967cited by this paper
• The composition of graphs

  1959cited by this paper

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

  2023cites this paper
• The Geometric Kernel of Integral Circulant Graphs

  2021cites this paper
• Arc transitive circulants

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

  2019cites 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
• Rotational circulant graphs

  2013influential citation
• Automorphism Groups of Rational Circulant Graphs

  2012cites this paper
• On Circulants Uniquely Characterized by their Independence Polynomials

  2012cites this paper
• Isomorphism testing for circulant graphs C n ( a , b )

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

  2010cites this paper
• CHECKING FOR ISOMORPHISM IN CIRCULANT GRAPHS

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

  2009cites this paper
• INDEPENDENCE POLYNOMIALS OF CIRCULANT GRAPHS

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

  2004cites this paper
• Enumeration ofCayley graphs and digraphs

  2002cites this paper
• Enumeration of Cayley graphs and digraph

  2002cites this paper