一类新的基于第十九家族的LA 群.pdfVIP

2012年12月 广西师范学院学报：自然科学版Dee．2012 第29卷第4期 Journalof TeachersEducation ScienceEditionV01．29No．4 Guangxi University：Natural 文章编号：1002—8743(2012}04—0021—04 The of BipartiteMatchingExtendability Spider—webGraphs GUO IN Meng—xia，DENGTian—yan，JJian—xing of (SchoolMathematical TeachersEducation Sciences，Guangxi 530023，P．R．China) University，Nanning Abstract：A MofGis if is matching bipartitematchingG[V(M)]is ex— bipartitegraph．Gk-bipartite—matching if tendable MofGwithM includedina of everybipartitematching I≤点(1≤^≤(V(G)～2)／2)isperfectmatching G．Themainresultisas isnota extendableanditisnota follows：Spider—Web graphs bipartite-matching 2-bipartite— extend—able． matching Keywords：bipartitematching；bipartitematchingextendable；Spider—web graph CLC Document number：0157．5 code：A 1 Introduction Motivatedthe ofk—extendable k—factor—critical by study graphs，IM—extendablegraphs，and graphs， andthefactthatthereareessentialdifferencesbetween of and by matchingproblemsnon—bipartitegraphs thoseof Xiu—mei anew extendablein bipartitegraphs，Wangproposesnotion—bipartitematching graphs schola