Skip to main content
Log in

Isomorphisms of Connected Cayley Digraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let G be a finite group and let Cay() be a Cayley graph of G. The graph Cay() is called a CI-graph of G if, for any for some Aut(G) only when CayCay(). In this paper, we study the isomorphism problem of connected Cayley graphs: to determine the groups G (or the types of Cayley graphs for a given group G) for which all connected Cayley graphs for G are CI-graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, C. Isomorphisms of Connected Cayley Digraphs. Graphs Comb 14, 37–44 (1998). https://doi.org/10.1007/PL00007218

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007218

Keywords

Navigation