Maximal Non-r-CD-factor-critical Graph and Degree Condition of r-CD-factor-critical Graph论文.pdfVIP

Contents Abstract．．．．．．．．．．．．．．．．．．．．．．．，．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．2 1．Introduction……．．．．．．…．．．…．…．．．．．………．…．．．………．．…．。4 2．Maximalnon-r—CD-factor-critical graphs．．．．．．．．．．．．．．．．．．．．．．．9 of factor—critical．．．．．16 Condition 3．Degree r—Clique—deletable References…．．．…………．…．………………．．．．．．…．………．……21 Acknowledgements．．．…．．…．．．…．．．．．．……．．．．．．．．…．．．．．．．……．．．23 舢Y㈣25㈣40㈣43㈣6 摘 要 个完美匹配，我们就称G是r团可删因子临界图，简称G是r—CD因子临界图．如果简单连 界图，我们就称G是极大非r—CD因子临界图．在本文L}1，我们刻画了极大非叮一CD因子临 界图的结构，并给出了G是r—CD因子临界的度条件． 关键词团；r—CD因子临界图；极大非一r—CD因子临界图；度条件 2 Abstract A connectedGis 71一CD—factor— simple graphr—clique—deletableIactor-critical．shortly for SofGwhosesizeisnotmorethanr andhasthesame critical，if everyclique with hasa connected is parity perfectmatching．Asimple G v(a)I，G—S graph maximalnon ifGisnotr—CD—factor—criticaland isr—CD— r—CD-factor—critical G+xy factor—criticalfor two verticeszand this characterize everynonadjacent Y．In paper，we themaximalnon—r—CD—factor—criticaland the conditionof graphsgive degree r—CD—factor— critical． Keywordsclique；7一CD—factor—critical；maximal condi— non—r—CD—factor—critical；degree tion 3 1 Introduction 1。1Introductionand preliminaries Thereaderisreferred undefinedterlnsand