| 具有唯一完美匹配的D-图 |
| |
| 引用本文： | 边红.具有唯一完美匹配的D-图[J].数学研究,2009,42(3):275-279. |
| |
| 作者姓名： | 边红 |
| |
| 作者单位： | 新疆师范大学数理信息学院,新疆,乌鲁木齐,830054 |
| |
| 基金项目： | The Research Fund for the Doctoral Program of Higher Education，国家自然科学基金 |
| |
| 摘 要： | 为了研究具有完美匹配图的Tuttc集和极端集,文献1,2]提出了一种新的图运算,并且得到了许多有趣的性质。本文中,我们刻画了level（G）=0的具有唯一完美匹配的饱和图G,并且确定了具有唯一完美匹配图的D-图的边数的紧上界。
|
| 关 键 词： | D-图 唯一完美匹配 |
The D-graphs of a Graph with Unique Perfect Matching |
| |
| Bian Hong.The D-graphs of a Graph with Unique Perfect Matching[J].Journal of Mathematical Study,2009,42(3):275-279. |
| |
| Authors: | Bian Hong |
| |
| Institution: | Bian Hong (School of Maths-physics and Information Sciences, Xinjiang Normal University, Urumqi Xinjiang 830054) |
| |
| Abstract: | A new graph operator was introduced to aid in the investigation of Tutte sets and extreme sets of graphs which had perfect matchings in1,2],and many interesting properties had been obtained.In this paper,we characterize the saturated graph G having unique perfect matching with level(G)=0 and give the sharp upper bound of the number of lines of the D-graph D(G) of the graphs with unique perfect matching. |
| |
| Keywords: | D-graphs unique perfect matching |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
