Skip to main content Accessibility help
×
Home

Isomorphisms of Cayley digraphs of Abelian groups

  • Cai Heng Li (a1)

Abstract

For a finite group G and a subset S of G with 1 ∉ S, the Cayley graph Cay(G, S) is the digraph with vertex set G such that (x, y) is an arc if and only if yx−1S. The Cayley graph Cay(G, S) is called a CI-graph if, for any TG, whenever Cay (G, S) ≅ Cay(G, T) there is an element a σ ∈ Aut(G) such that Sσ = T. For a positive integer m, G is called an m-DCI-group if all Cayley graphs of G of valency at most m are CI-graphs; G is called a connected m-DCI-group if all connected Cayley graphs of G of valency at most m are CI-graphs. The problem of determining Abelian m-DCI-groups is a long-standing open problem. It is known from previous work that all Abelian m-DCI-groups lie in an explicitly determined class of Abelian groups. First we reduce the problem of determining Abelian m-DCI-groups to the problem of determining whether every subgroup of a member of is a connected m-DCI-group. Then (for a finite group G, letting p be the least prime divisor of |G|,) we completely classify Abelian connected (p + 1)-DCI-groups G, and as a corollary, we completely classify Abelian m-DCI-groups G for mp + 1. This gives many earlier results when p = 2.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Isomorphisms of Cayley digraphs of Abelian groups
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Isomorphisms of Cayley digraphs of Abelian groups
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Isomorphisms of Cayley digraphs of Abelian groups
      Available formats
      ×

Copyright

References

Hide All
[1]Adám, A., ‘Research problem 2–10’, J. Combin. Theory 2 (1967), 309.
[2]Alspach, B. and Parsons, T.D., ‘Isomorphisms of circulant graphs and digraphs’, Discrete Math. 25 (1979), 97108.
[3]Babai, L.Isomorphism problem for a class of point-symmetric structuresActa Math. Acta. Sci. Hungary 29 (1977), 329336.
[4]Babai, L. and Frankl, P., ‘Isomorphisms of Cayley graphs I’, Colloq. Math. Soc. János Bolyai 18 (1978), 3552.
[5]Delorme, C., Favaron, O. and Maheo, M., ‘Isomorphisms of Cayley multigraphs of degree 4 on finite Abelian groups’, European J. Combin. 13 (1992), 5961.
[6]Dobson, E., ‘Isomorphism problem for Cayley graphs of ’, Discrete Math. 147 (1995), 8794.
[7]Elspas, B. and Turner, J., ‘Graphs with circulant adjacency matrices’, J. Combin. Theory 9 (1970), 297307.
[8]Fang, X.G., ‘A characterization of finite Abelian 2-DCI groups’, (in Chinese), J. Math. (Wuhan) 8 (1988), 315317.
[9]Fang, X.G., ‘Abelian 3-DCI groups’, Ars Combin. 32 (1992), 263267.
[10]Fang, X.G. and Xu, M.Y., ‘Abelian 3-DCI groups of odd order’, Ars Combin. 28 (1988), 247251.
[11]Godsil, C.D., ‘On Cayley graph isomorphisms’, Ars Combin. 15 (1983), 231246.
[12]Li, C.H., ‘Abelian 4-DCI groups’, J. Yunnan Normal University 11 (1991), 2427.
[13]Li, C.H., ‘On Cayley graphs of Abelian groups’, J. Algebraic Combin. (to appear).
[14]Li, C.H., ‘On isomorphisms of connected Cayley graphs’, Discrete Math. (to appear).
[15]Li, C.H., ‘Isomorphisms of connected Cayley digraphs’, Graphs Combin. (to appear).
[16]Li, C.H., ‘The cyclic groups with the m-DCI property’, European J. Combin. 18 (1997), 655665.
[17]Li, C.H., Praeger, C.E. and Xu, M.Y., ‘Isomorphisms of finite Cayley digraphs of bounded valency’, J. Combin. Theory Ser. B (to appear).
[18]Muzychuk, M., ‘Ádám's conjecture is true in the square-free case’, J. Combin. Theory Ser. A 72 (1995), 118134.
[19]Muzychuk, M., ‘On Ádám's conjecture for circulant graphs’, Discrete Math. 167/168 (1997), 497510.
[20]Nowitz, L.A., ‘A nonCayley-invariant Cayley graph of the elementary Abelian group of order 64’, Discrete Math. 110 (1992), 223228.
[21]Sun, L., ‘Isomorphisms of circulant graphs’, Chinese Ann. Math. Ser. A 9 (1988), 567574.
[22]Xu, M.Y. and Meng, J., ‘Weakly 3-DCI Abelian groups’, Austral. J. Combin. 13 (1996), 4960.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Isomorphisms of Cayley digraphs of Abelian groups

  • Cai Heng Li (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed