| On the Edge-forwarding Indices of Frobenius Graphs |
| |
| 作者姓名： | Yan WANG Xin Gui FANG D. F. HSU |
| |
| 作者单位： | [1]Department of Mathematics, Yantai University, Yantai 264005, P. R. China [2]LMAM ＆ Department of Mathematics, Peking University, Beijing 100871, P. R. China [3]Department of Computer ＆ Information Sciences, Fordham University, New York 10023, USA [4]DIMA CS Center, Rutgers University, 96 Frelinghuysen Road, Piscataway, New Jersey 08854, USA |
| |
| 基金项目： | The first two authors are supported by the Natural Science Foundation （No. 10571005） and RFDP of China |
| |
| 摘 要： | 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.
|
| 关 键 词： | Frobenius图 网络 边缘推进指标 轨道图 |
| 收稿时间： | 2004-12-13 |
| 修稿时间： | 2004-12-132006-01-26 |
On the Edge-forwarding Indices of Frobenius Graphs |
| |
| Yan WANG Xin Gui FANG D. F. HSU.On the Edge-forwarding Indices of Frobenius Graphs[J].Acta Mathematica Sinica,2006,22(6):1735-1744. |
| |
| Authors: | Yan Wang Xin Gui Fang D F Hsu |
| |
| Institution: | (1) Department of Mathematics, Yantai University, Yantai 264005, P. R. China;(2) LMAM & Department of Mathematics, Peking University, Beijing 100871, P. R. China;(3) Department of Computer & Information Sciences, Fordham University, New York 10023, USA;(4) DIMACS Center, Rutgers University, 96 Frelinghuysen Road, Piscataway, New Jersey 08854, USA |
| |
| Abstract: | A G-Frobenius graph Γ, 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. Γ is also shown
to be a Cayley graph, Γ = 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 the 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
Γ with rank(G) ≤ 50.
The first two authors are supported by the Natural Science Foundation (No. 10571005) and RFDP of China |
| |
| Keywords: | Frobenius graph networks edge-forwarding index |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
