|本期目录/Table of Contents|

[1]俞林.近完美匹配全覆盖点[J].集美大学学报(自然科学版),2014,19(1):53-56.
　YU Lin.Near-perfect Matching Totally Covered Vertices[J].Journal of Jimei University,2014,19(1):53-56.
点击复制

近完美匹配全覆盖点()
分享到：

《集美大学学报（自然科学版）》[ISSN:1007-7405/CN:35-1186/N]

卷:
第19卷
期数:
2014年第1期
页码:
53-56
栏目:
数理科学与信息工程
出版日期:
2014-01-25

文章信息/Info

Title:
Near-perfect Matching Totally Covered Vertices
作者:
俞林
集美大学理学院,福建 厦门 361021
Author(s):
YU Lin
School of Science,Jimei University,Xiamen 361021,China
关键词:
近完美匹配; 全覆盖点; Gallai-Edmonds结构定理
Keywords:
near-perfect matching; totally covered vertex; Gallai-Edmonds structure theorem
分类号:
-
DOI:
-
文献标志码:
A
摘要:
利用匹配理论中的Gallai-Edmonds结构定理,首先得到了在一个有近完美匹配的图中判定一个顶点为近完美匹配全覆盖点的充要条件,然后对每一个顶点都为近完美匹配全覆盖点的图类给出了一个刻画.同时,也给出了一种构造这类图的方法.
Abstract:
By using the Gallai-Edmonds structure theorem in matching theoery,a sufficient and necessary condition for a vertex to be a near-perfect matching totally covered vertex was first obtained,then a characterization of graphs was given whose vertices were all near-perfect matching totally covered vertices. At the same time,a method to construct these graphs was also given.

参考文献/References:

-

相似文献/References:

备注/Memo

备注/Memo:
-
更新日期/Last Update: 2014-12-01