Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지

NORMAL EDGE-TRANSITIVE CIRCULANT GRAPHS

  • Sim, Hyo-Seob (Division of Mathemtical Sciences, Pukyoung National University) ;
  • Kim, Young-Won (DIVISION OF MATHEMATICAL SCIENCES, PUKYONG NATIONAL UNIVERSITY)
  • Published : 2001.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

A Cayley graph of a finite group G is called normal edge-transitive if its automorphism group has a subgroup which both normalized G and acts transitively on edges. In this paper, we consider Cayley graphs of finite cyclic groups, namely, finite circulant graphs. We characterize the normal edge-transitive circulant graphs and determine the normal edge-transitive circulant graphs of prime power order in terms of lexicographic products.

Keywords

References

  1. J. Combin. Theory v.2 Research problem 2-10 A. Adam
  2. J. Combin Theory v.9 Graphs with circulant adjacency matrices B. Elspas;J. Turner
  3. Priprint, AdWDDR, ZIMM The Konig problem the isomorphism problem for cyclic graphs and the method of Schur rings M. H. Klin;R. Poschel
  4. Preprint P34/80 AdWDDR, ZIMM The isomorphism problem for circulant digraphs with vertices
  5. M. Sc. Thesis(University of Western Australia) Quotients of normal edge-transiteve Cayley graphs P. Houlis
  6. J. Combin Theory Ser. v.A72 Adam's conjecture is true in the square-free case Mikhail Muzychuk
  7. Discrete Mathematics v.176 Corrigendum: On Adam's conjecture for circulant graphs
  8. Bull. Austral. Math. Soc. v.60 Finite normal edge-transitive Cayley graphs Cheryl E. Praeger
  9. Finite Permutation Groups H. Wielandt