欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
研究并改进了导出匹配可扩二部图的度和条件.主要结论如下:若图G是一个有二部划分(A,B)的二部图,且|A|=|B|=n=3k+1(k≥2),如果对图G中任意不相邻的顶点u和v,有d(u)+d(v)≥4k+1,那么图G是导出匹配可扩的,并且该结果是最佳可能的.
英文摘要：
A simple graph G was induced matching extendable,if every induced matching of G was included in a perfect matching of G.The degree sum condition for induced matching extendable bipartite graphs was improved.The main results are as follows.Let G be a bipartite graph with bipartition(A,B),where |A|=|B|=n=3k+1(k≥2).If d(u)+d(v)≥4k+1 for each pair of nonadjacent vertices u and v in G,then G is induced matching extendable,and the result is best possible.
同期刊论文项目
同项目期刊论文
期刊信息
位置：