On orbital regular graphs and Frobenius graphs

X.G. Fang, Cai-Heng Li, Cheryl Praeger

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)85-99
JournalDiscrete Mathematics
Publication statusPublished - 1998


Dive into the research topics of 'On orbital regular graphs and Frobenius graphs'. Together they form a unique fingerprint.

Cite this