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.
机构:
Univ Fed Rio Grande do Sul, Inst Matemat & Estat, Porto Alegre, RS, BrazilUniv Fed Rio Grande do Sul, Inst Matemat & Estat, Porto Alegre, RS, Brazil
Hoppen, Carlos
Wormald, Nicholas
论文数: 0引用数: 0
h-index: 0
机构:
Monash Univ, Sch Math Sci, Clayton, Vic, AustraliaUniv Fed Rio Grande do Sul, Inst Matemat & Estat, Porto Alegre, RS, Brazil