On the Edge-forwarding Indices of Frobenius Graphs

被引:0
|
作者
Yan WANG Department of Mathematics
机构
关键词
Frobenius graph; networks; edge-forwarding index;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
摘要
A G-Frobenius graph Γ,as defined by Fang,Li,and Praeger,is a connected orbital graph ofa Frobenius group G=K H with Frobenius kernel K and Frobenius complement H.Γ is also shownto 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 arouting 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,isa parameter to describe the maximum load of edges of N.In this paper,we study the edge-forwardingindices of Frobenius graphs.In particular,we obtain the edge-forwarding index of a G-Frobenius graphΓ with rank(G)≤50.
引用
收藏
页码:1735 / 1744
页数:10
相关论文
共 50 条