图论中的N-因子-临界性和哈密尔顿连通性.pdfVIP

DisSertation0fMS of Normal DegreeJiallgXi Umversity AND N—FACTOR—CRITICALITYHAMILTON CONNECTIVITYINGRAPH THEOREY ThstheSis o。ncentrateSan and in majrdy n～factor—criticality n—extendablity willfindthefirsttwo thatcontajn the。ry，and、ve more。rless graph ch印ters indepelldent withinthjsre㈣hfield． topics InthefirSt we the result： chapterprovefol栅ing LetGbe of agraphorderpⅥdth户三n(”Iod 2)aJld挖户，ifd(“)十d(口)≥户十 竹一1for of ofG谢th Gis挖一 everypajrnonadjacemvenices甜，u d(“，口)=2，then factor—critical． this weobtainsome By theory c。r0【1aries，which interesting include”一extendablity． Intheseo。nd can the conditio士1Softwo chapter，wepmve prop。sitions inv。lving九一 are factor—criticalityequivalent： LetGbea五～∞nnectedoforder m】工11ber口 graph p，∞nnectivity五，independence the t、vo are (G)andO≤n≤矗，then c。nditions foUawing equivalent： (1)口(G)≤E～n+1 exist (2)there s、^，ith2≤5≤五suchthat h。1dsfor ainteger IN(s)l+矗≥声+n一1 setS。fsvenicesinG． eve珂independent InthelaSt wefocus for harnilton—con． chapter， on‰lto