
浏览全部资源
扫码关注微信
1. ,山西,太原,030051
2. 山西大学数学系,山西,太原,030006
纸质出版:2003
移动端阅览
原军, 王世英. 一类互联网络模型[J]. 中北大学学报(自然科学版), 2003,(5):363-365.
原军, 王世英. A Class of Interconnection Network Models[J]. 2003, (5): 363-365.
设Sn是一个对称群.让n表示{1
2
…
n}
B*表示Sn中所有对换的集合.设B是B*的任一子集.关于B的对换图Wn被定义为:顶点集是n
边集是{[uv]:(uv)∈B}.如果Wn是一棵树
则这个对称图称为一棵对换树Tn.Tn是Sn的一个极小生成集.研究了Cayley图Cay(Sn
Tn)的性质
从而说明了这类互连网络模型的优越性.
Let \%S\-\{n\}\% be the symmetric group. Let \%n\% equal \%{1
2
\:
n}
B\+\{*\}\% denote the set of all transpositions for \%S\-\{n\}\% and let \%B\% be any sabset of \%B\+*\%. The transposition graph \%W\-\{n\}\% with respect to \%B\% is defined by taking \%n\% as \%V\%set and \%{\:(uv)∈B}\% as lateral set. A transposition graph is called a transposition tree \%T\-\{n\}\% if \%W\-\{n\}\% is a tree. \%T\-\{n\}\% is a minimal generating set of \%S\-\{n\}\%. In this paper
we study the properties of the Cayley graph Cay\%(S\-n
T\-n)\%. Prove that this model is a nice model.
AkersSB,KrishnamurthyB.Agroup-theoreticmodelforsymmetricinterconnectionnetworks[J].IEEETransac-tionsonComputers,1989,38(4):555-666.
WangSY.HamiltonianpropertyofCayleygraphsonsymmetricgroups( )[J].JournalofXinjiangUniversity,1994,11(3):16-18.
WangSJ.HamiltonianpropertyofCayleygraphsonsymmetricgroups( )[J].JournalofXinjiangUniversity,1994,11(4):25-35.
GodsilCD.ConnectivityofminimalCayleygraphs[J].Arch.Math.,1981,37:473-376.
HamidouneYO.Subsetswithsmallsumsinabeliangroups :Vosperproperty[J].Europ.J.Combin,1997,4:541-556.563
0
浏览量
45
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621