图的匹配复形  

MATCHING COMPLEX OF GRAPHS

作　　者：张兰菊[1] 

机构地区：[1]山东大学数学与系统科学学院,山东济南250100

出　　处：《山东大学学报（理学版）》2001年第1期18-21,共4页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金!资助项目 ( 69772 0 1 7) ;高校博士点资助!项目 ( 970 4 2 2 0 7) .

摘　　要：给定图G=(V(G) ,E(G) ) .如果M E(G)中任意两条边不相邻 ,则称M是G的一个匹配 .以图G的所有匹配为单形的复形叫做图G的匹配复形 ,记作M(G) .研究了M(G)的一些性质 ,如M(G)的Betti数 ,和图G的关系等 .By introducing topology method to graph theory,we can get some notions and parameters that are somewhat new from the perspective of graph theory.Many attempts have been made and some results have been obtained on graphs′ clique complex,independent complex and their topology properties.In this paper graphs′ matching complex is introduced in.Some characterizations are also presented on Betti numbers and relations between a graph and its matching complex.

关 键 词：匹配 匹配复形 BETTI数 

分 类 号：O157.5[理学—数学]