摘要
在Tutte关于完美对集存在的充要条件基础上,针对具有偶数个(υ个)顶点,且顶点的最小度数δ≥υ/2-1的简单图G,通过构造的连接方法,论证了图G中有完美对集的充分条件。
On the theoretical basis of the necessary and sufficient conditions for the perfect matching derived by Tutte, a sufficient condition is further derived as follows in this paper, when the number of vertex in simple graph G is even number, and the minimum degree number of vertex is δ≥u/2 - 1 in simple graph G. It is testified via the forming connection method that there is a sufficient condition of perfect matching in graph G, there is a perfect matching.
出处
《西安理工大学学报》
CAS
2005年第3期321-323,共3页
Journal of Xi'an University of Technology
关键词
简单图
完美对集
通路
充分条件
simple graph
perfect matching
path
sufficient condition
