On orbital regular graphs and frobenius graphs

A graph is called a Frobenius graph if it is a connected orbital graph of a Frobenius group. In this paper, we show first that almost all orbital regular graphs are Frobenius graphs. Then we give a description of Frobenius graphs in terms of a family of (usually smaller) Frobenius graphs which are Cayley graphs for elementary abelian groups. Finally, based on this description, we obtain a formula for calculating the edge-forwarding index of Frobenius graphs.

[1]  W. Scott,et al.  Group Theory. , 1964 .

[2]  John G. Thompson,et al.  Normalp-complements for finite groups , 1959 .

[3]  H. Wielandt,et al.  Finite Permutation Groups , 1964 .

[4]  J Thompson,et al.  FINITE GROUPS WITH FIXED-POINT-FREE AUTOMORPHISMS OF PRIME ORDER. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[5]  N. Biggs.  Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[6]  Cai Heng Li.  On isomorphisms of connected Cayley graphs , 1998, Discret. Math..

[7]  Patrick SoK.  The edge-forwarding index of orbital regular graphs , 1994 .

[8]  B. Huppert.  Endliche Gruppen I , 1967 .

[9]  Edward Dobson,et al.  Isomorphism problem for Cayley graphs of Zp3 , 1995, Discret. Math..

[10]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

[11]  Patrick Solé,et al.  The edge-forwarding index of orbital regular graphs , 1994, Discret. Math..

[12]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .