| 两树和图的Cordial性问题 |
| |
| 引用本文： | 堵根民.两树和图的Cordial性问题[J].延边大学理工学报,2008,34(4). |
| |
| 作者姓名： | 堵根民 |
| |
| 作者单位： | 呼和浩特职业学院数学系 |
| |
| 基金项目： | 内蒙古自然科学基金
|
| |
| 摘 要： | 两个图的和图Cordial性的研究结果甚少且方法单一.本文采用粘接边或删除边的方法,给出了两树和图为Cordial图的充分必要条件:两树不都是奇度图.
|
| 关 键 词： | Cordial性 树 两树和图 |
On Cordiality of the Join of Two Trees |
| |
| DU Gen-min.On Cordiality of the Join of Two Trees[J].Journal of Yanbian University (Natural Science),2008,34(4). |
| |
| Authors: | DU Gen-min |
| |
| Abstract: | There are few discussions about the cordiality of the join of two graphs and researching methods are almost the same.A both necessary and sufficient premise for the statement is given by adding or deleting edges,that the join of two trees is a Cordial graph if and only if neither is odd-degree. |
| |
| Keywords: | Cordial label tree join of two trees |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
