-
39浏览
-
0点赞
-
0收藏
-
0分享
-
366下载
-
0评论
-
引用
期刊论文
Generalization of matching extensions in graphs
Discrete Mathematics 231 (2001) 311-320,-0001,():
Let G be a graph with vertex set V(G). Let n; k and d be non-negative integers such that n+2k+d6|V(G)|−2 and |V(G)|−n−d is even. A matching which covers exactly |V(G)|−d vertices of G is called a defect-d matching of G. If when deleting any n vertices of G the remaining subgraph contains a matching of k edges and every k-matching can be extended o a defect-d matching, then G is called a (n; k; d)-graph. In this paper a characterization of (n; k; d)-graphs is given and several properties (such as connectivity, minimum degree, hierarchy, etc.) of (n; k; d)-graphs are investigated.
【免责声明】以下全部内容由[于青林]上传于[2006年02月16日 18时23分37秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果