Skip to main content
SpringerLink
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

Log in via an institution

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Western Australia, Nedlands W.A. 6907, Australia. e-mail:li@maths.uwa.edu.au, , , , , , AU

    Cai Heng Li

Authors
  1. Cai Heng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Search

Navigation