计算机与数字工程2017，Vol.45Issue(11)：2097-2098,2196,3.DOI:10.3969/j.issn.1672-9722.2017.11.004
步长为1和4的循环图的k-偶匹配可扩性
k-bipartite Matching Extendability of Circulant Graph with Step Length 1 and 4
摘要
Abstract
G is said to be bipartite matching-extendable,if every bipartite matching M of is included in a perfect matching of G . The problem determining whether there is a bipartite matching of cardinality k in a graph G is NP-complete. This paper shows that the k-bipartite matching extendability of circulant graphs C2n(1,4) .关键词
完美匹配/偶匹配可扩/k-偶匹配可扩/循环图Key words
pefrect matching/bipartite matching/k-bipatrite matching extendable/circulant graph分类
数理科学引用本文复制引用
惠志昊..步长为1和4的循环图的k-偶匹配可扩性[J].计算机与数字工程,2017,45(11):2097-2098,2196,3.基金项目
平顶山学院青年科研基金项目(编号:2012001) （编号:2012001）
河南省科技厅重点科技攻关项目(编号:132102310126)资助. （编号:132102310126）
