摘要
简单图的最大匹配与完美匹配一般算起来比较困难,而且至今未见用矩阵解决这类问题的报道.利用图的邻接矩阵及关联矩阵求简单图的最大匹配和二分图的完美匹配,对于二分图的完美匹配及一般简单图的最大匹配各给出了两种方法,这些方法简洁又便于用矩阵软件进行计算.
It is difficult to culculate the simple gragh＇s perfect matching and maximum matching. Additionally, till today there is no report about revolving such problems using matrix. This study calculates the gragh＇s maximum matching and bigragh perfect matching by gragh＇s adjacency matrix and relevance matrix. Also this study offers two methods about bigragh perfect matching and simple gragh. These methods are simple and also convenient for using matrix software to calculate.
出处
《数学的实践与认识》
CSCD
北大核心
2007年第7期120-124,共5页
Mathematics in Practice and Theory
基金
湖南省教育厅科学研究项目(03C539)
湖南科技大学基金资助项目(G30507)
关键词
合同变换
简化邻接矩阵
关联矩阵
余子阵
submatrix congruent transformation
simply adjacency matrix
relevance matrix
rest
