（n，k）-排列图的条件连通度.pdfVIP

第 45卷 第 4期 数 学 研 究 V01．45 NO．4 2012年 12月 JournalofMathematicalStudy Dec．2012 ConditionalConnectivityfor (，)一arrangementGraphs LinLimeiI ZhouShuming， (1．SchoolofMathematicsandComputerScience，FujianNormalUniversity,FuzhouFujian，350007 2．KeyLaboratoryofNetworkSecurityandCryptology,FujianNormalUniversity,Fuzhou Fujian，350108) Abstract Vertex connectivityisan importantparametertomeasurethefaulttoleranceofin- terconnection networks．Even though itreflectsthefaulttolerancecorrectly；itundervaluesthe resilienceoflargenetworks．Conditionalconnectivityplacessomerequirementsonthecomponents (whenthenetworkisdestroyed)toovercomethisshortcoming．Givenanetworkbasedonagraph G andapositiveintegerl，theRz_connectivityofG denotedby (‘G)，istheminimumcardinality ， ofasetofverticesinG，ifany，whosedeletiondisconnectsG，andeveryremainingcomponenthas minimumdegreeatleastf．Inthiswork，weestablishthat (A ．k)=[(f+1)k—f](n—k)一jfor the(n，)一arrangementrgaphA ，kwithk l+2and礼 k+z． Keywords Faulttolerance；Conditionalconnectivity；(n，)一arrangementrgaph CLC number O175．5 Docum entcode A 1 Introduction Forthepurposeofconnectinghundredsofthousandsprocessingelements，many interconnectionnetworktopologieshavebeenproposedintheliterature．Theinter- connectionnetworktopologyisusuallyrepresentedbyagraphG= ( )，while verticesrepresentprocessorsand edgesrepresentlinksbetweenprocessors[1 ． The subgraphofGinducedbyS，denotedbya[s]，isthegraphwiththevertex-setSand theedge-set{(，)f(，V)∈ (G)，，∈ )．Theneighborhoodsetofavertex is denotedbyA ()，simplifiedasN(v)={I(v，)∈E．)．Theneighborhoodsetof avertex inSisdenotedbyⅣs()，thatis，Ns()=ⅣG()nS．