On the Edge-forwarding Indices of Frobenius Graphs

作     者：Yan WANG Xin Gui FANG D. F. HSU 

作者机构：Department of Mathematics Yantai University Yantai 264005 P. R. China LMAM & Department of Mathematics Peking University Beijing 100871 P. R. China Department of Computer & Information Sciences Fordham University New York 10023 USA DIMA CS Center Rutgers University 96 Frelinghuysen Road Piscataway New Jersey 08854 USA 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2006年第22卷第6期

页      面：1735-1744页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：The first two authors are supported by the Natural Science Foundation(No.10571005)and RFDP of China 

主　　题：Frobenius graph networks edge-forwarding index 

摘      要：A G-Frobenius graph F, as defined by Fang, Li, and Praeger, is a connected orbital graph of a Frobenius group G = K × H with Frobenius kernel K and Frobenius complement H. F is also shown to be a Cayley graph, F = Cay（K, S） for K and some subset S of the group K. On the other hand, a network N with a routing function R, written as （N, R）, is an undirected graph N together with a routing R which consists of a collection of simple paths connecting every pair of vertices in the graph. The edge-forwarding index π（N） of a network （N, R）, defined by Heydemann, Meyer, and Sotteau, is a parameter to describe tile maximum load of edges of N. In this paper, we study the edge-forwarding indices of Frobenius graphs. In particular, we obtain the edge-forwarding index of a G-Frobenius graph F with rank（G） ≤ 50.