| 关于几乎k-可扩图的若干结论 |
| |
| 引用本文： | 翟绍辉.关于几乎k-可扩图的若干结论[J].厦门理工学院学报,2010,18(1):18-20,23. |
| |
| 作者姓名： | 翟绍辉 |
| |
| 作者单位： | 厦门理工学院数理系,福建,厦门,361024 |
| |
| 基金项目： | 福建省教育厅科技项目(JA08223) |
| |
| 摘 要： | 设G是具有奇数个顶点的图,k是非负整数且满足V(G)≥2k+1,若G中任意一个k-匹配都可以扩充为G的一个几乎完美匹配,则称G是几乎k-可扩图.文中证明了连通的几乎1-可扩图与2-连通的几乎k-可扩二部图分别添加一个新边后仍保持原来的可扩性.
|
| 关 键 词： | 几乎k-可扩图 几乎完美匹配 去边 加边 |
Some Results on Near k-extendable Graphs |
| |
| ZHAI Shao-hui.Some Results on Near k-extendable Graphs[J].Journal of Xiamen University of Technology,2010,18(1):18-20,23. |
| |
| Authors: | ZHAI Shao-hui |
| |
| Institution: | Faculty of Mathematics and Physics/a>;Xiamen University of Technology/a>;Xiamen 361024/a>;China |
| |
| Abstract: | Let G be a graph with odd order and k a non-negative number satisfing ｜V（G）｜≥2k＋1. G is called near k-extendable graph if any k-matching of G can be extended to a near perfect matching of G. In this paper, we prove that if G is a connected near/-extendable graph （resp. 2-connected near k-extendable graph）, then there exists e ∈ E（G） such that G ＋ e is still connected near 1-extendable （resp. 2-connected near k-extendable）. |
| |
| Keywords: | near k-extendable graphs near perfect matching deleting edge adding edge |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
