TY - JOUR
T1 - On orbital regular graphs and Frobenius graphs
AU - Fang, X.G.
AU - Li, Cai-Heng
AU - Praeger, Cheryl
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
U2 - 10.1016/S0012-365X(97)00148-9
DO - 10.1016/S0012-365X(97)00148-9
M3 - Article
SN - 0012-365X
VL - 182
SP - 85
EP - 99
JO - Discrete Mathematics
JF - Discrete Mathematics
ER -