Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T02:54:52.239Z Has data issue: false hasContentIssue false
  • English
  • Français

On isomorphisms of connected Cayley graphs, III

Published online by Cambridge University Press:  17 April 2009

Cai Heng Li
Cai Heng Li
Affiliation:
Department of Mathematics, University of Western Australia, Nedlands WA 6907, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For a finite group G and a subset S of G which does not contain the identity of G, we use Cay(G, S) to denote the Cayley graph of G with respect to S. For a positive integer m, the group G is called a (connected) m-DCI-group if for any (connected) Cayley graphs Cay(G, S) and Cay(G, T) of out-valency at most m, Sσ = T for some σ ∈ Aut(G) whenever Cay(G, S) ≅ Cay(G, T). Let p(G) be the smallest prime divisor of |G|. It was previously shown that each finite group G is a connected m-DCI-group for m ≤ p(G) − 1 but this is not necessarily true for m = p(G). This leads to a natural question: which groups G are connected p(G)-DCI-groups? Here we conjecture that the answer of this question is positive for finite simple groups, that is, finite simple groups are all connected 2-DCI-groups. We verify this conjecture for the linear groups PSL(2, q). Then we prove that a nonabelian simple group G is a 2-DCI-group if and only if G = A5.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 58 , Issue 1 , August 1998 , pp. 137 - 145
Copyright
Copyright © Australian Mathematical Society 1998

References

[1]Alspach, B., ‘Isomorphisms of Cayley graphs on Abelian groups’, in Graph Symmetry: Algebraic Methods and Applications 497, NATO Adv. Sc. Inst. Ser. C (Kluwer Acad. Publ., Dordrecht, 1997), pp. 1–23.Google Scholar
[2]Alspach, B. and Parsons, T.D., ‘Isomorphisms of circulant graphs and digraphs’, Discrete Math. 25 (1979), 97–108.CrossRefGoogle Scholar
[3]Babai, L., Isomorphism problem for a class of point-symmetric structures, Acta Math. Acad. Sci. Hungar. 29 (1977), 329–336.CrossRefGoogle Scholar
[4]Biggs, N., Algebraic graph theory (Cambridge University Press, New York, 1992).Google Scholar
[5]Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A. and Wilson, R.A., Atlas of finite groups (Clarendon Press, Oxford, 1985).Google Scholar
[6]Delorme, C., Favaron, O. and Maheo, M., ‘Isomorphisms of Cayley multigraphs of degree 4 on finite Abelian groups’, European J. Combin. 13 (1992), 59–61.CrossRefGoogle Scholar
[7]Godsil, C.D., ‘On the full automorphism group of a graph’, Combinatorica 1 (1981), 243–256.CrossRefGoogle Scholar
[8]Guralnick, R., ‘Subgroups of prime power index in a simple group’, J. Algebra 81 (1983), 304–311.CrossRefGoogle Scholar
[9]Huppert, B. and Blackburn, N., Finite Groups III (Springer-Verlag, New York, 1982).CrossRefGoogle Scholar
[10]Kleidman, P.B. and Liebeck, M.W., The subgroup structure of the finite classical groups, London Math. Soc. Lecture Notes (Cambridge University Press, New York, Sydney, 1990).CrossRefGoogle Scholar
[11]Li, C.H., ‘On isomorphisms of connected Cayley graphs’, Disc. Math. 78 (1998), 109–122.Google Scholar
[12]Li, C.H., ‘Isomorphisms of Cayley digraphs of Abelian groups’, Bull. Austral. Math. Soc. 57 (1998), 181–188.CrossRefGoogle Scholar
[13]Li, C.H., ‘On isomorphisms of connectd Cayley graphs, II’, J. Combin. Theory (B) (to appear).Google Scholar
[14]Li, C.H., On isomorphisms of finite Cayley graphs – a survey, (UWA Research Report, 1998/8) (University of Western Australia, Australia).CrossRefGoogle Scholar
[15]Li, C.H. and Praeger, C.E., ‘The finite simple groups with at most two fusion classes of every order’, Comm. Algebra 24 (1996), 3681–3704.CrossRefGoogle Scholar
[16]Li, C.H., Praeger, C.E. and Xu, M.Y., ‘Isomorphisms of finite Cayley digraphs of bounded valency’, J. Combin. Theory (B) (to appear).Google Scholar
[17]Lorimer, P., ‘Vertex-transitive graphs: symmetric graphs of prime valency’, J. Graph Theory 8(1984), 55–68.CrossRefGoogle Scholar
[18]Pàlfy, P.P., ‘Isomorphism problem for relational structures with a cyclic automorphism’, European J. Combin. 8 (1987), 35–43.CrossRefGoogle Scholar
[19]Praeger, C.E., ‘Finite transitive permutation groups and finite vertex-transitive graphs’, in Graph symmetry: algebraic methods and applications 497, NATO Adv. Sc. Inst. Ser.C (Kluwer Acad., Dordrecht, 1997), pp. 277–318.CrossRefGoogle Scholar
[20]Sabidussi, G.O., ‘Vertex-transitive graphs’, Monatsh. Math. 68 (1964), 426–438.CrossRefGoogle Scholar
[21]Suzuki, M., Group theory I (Spring-Verlag, Berlin, Heidelberg, New York, 1982).CrossRefGoogle Scholar
[22]Xu, M.Y., ‘Half-transitive graphs of prime-cube order’, J. Algebric Combin. 1 (1992), 275–282.CrossRefGoogle Scholar
[23]Xu, M.Y. and Meng, J.X., ‘Weakly 3-DCI Abelian groups’, Australas. J. Combin. 13 (1996), 49–60.Google Scholar
[24]Zhang, J.P., ‘On finite groups all of whose elements of the same order are conjugate in their automorphism groups’, J. Algebra 153 (1992), 22–36.Google Scholar