VERTEX-FAULT-TOLERANT CYCLES EMBEDDING ON ENHANCED HYPERCUBE NETWORKS.pdfVIP

1580 ACTA MATHEMATICA SCIENTIA VoI．33Ser．B thehypereube．Thehypercubeis几一regularandn—connected．whereastheenhancedhypercube is(n+1)一regularand(n+1)一connected．Moreover，itsspecialcaseof =1isthewellknown foldedhypercubewhichwasdenotedbyFQn([11一l4])．Theobjectiveofthis paper1sto furtherextend theresearch oftheseunknown features，particularly those1mportant teatures alreadyknowntoQnbutunknowntoQn．． TheembeddingofoneguestgraphG intoanotherhostgraphH Callbedefinedasaone— to—onemappingffromthevertexsetofGtothevertexsetofH [15]．AnedgeofGcorresponds toapathofH underthemappingf．Pathandcycle，whichareafundamentaltopologyfor parallelanddistributed computing，issuitableforlocalareanetworksand ofrthedesigning simplealgorithniswith low communicationcost．Becausethesearchitecturesareextensively applied inparallelsystems，itiscrucialtoconsidertheembeddingofefficientpathsandcycles innetworksl16I．Wheninvestigatinganetwork，theedgesorverticesfailuresoftenoccur，it ispracticallymeaningflfltoconsiderfaultynetworks．Fault—tolerantembeddinginhypercubes hasbeenwidelyaddressedinresearches([3，5，7，12，1724])．Forexample，let ，and be thesetoffaultyverticesandfaultyedgesofQn，Lieta1．f3]provedthateveIY’fault—rfeeedge ofQ (n三=3)，liesonafault—freecycleofeveryevenlengthfrom4to2“ifl I= ，≤扎一2． Tsai[5]showedthateveryfault—freeedgeandfault—rfeevertexofQn(n 3)，liesOilafault—rfee cycleofveryevenlengthfrom4to2一2f,，if} l= 礼一2．Hsieh[12]recelltlYproved thatwhen 』=1，FQ， containsafallt—freecycleofeveryevenlengthfrom4to2 2．， if九 3；alldsimultaneously，containsafault—fleecycleofeveryoddlengthfrom n+ lt02”一 l if7,／(n 2)iseven．Xueta1．[17]showedthateveryfault—rfeeedgeofQn(n 4)，liesona fault—freecycleofeveryevenlengthrfom6to2 ifl I n 1．F1l[18】showedthata fault—freecycleoflength2 一2fvcanbeembeddedintoQnwithl I一．，≤2n一4．Hsieh I7lextendedtheresultofF11，provingthatQncontainsafault—fleecycleoflength2 一2L if 1 l—fc≤n 2and．+． 2n一4．