| 两类图色唯一的充分必要条件 |
| |
| 引用本文： | 王守中.两类图色唯一的充分必要条件[J].数学研究,1999,32(3):316-317. |
| |
| 作者姓名： | 王守中 |
| |
| 作者单位： | 广东石油化工高等专科学校基础部!茂名525000 |
| |
| 摘 要： | 利用图的伴随多项式的性质，给出了两类图色唯一的充分必要条件
|
| 关 键 词： | 图 伴随多项式 色唯一图 |
The Necessary and Sufficient Condition for Chromatic Uniqueness of two Classes of Graphs |
| |
| Wang Shouzhong.The Necessary and Sufficient Condition for Chromatic Uniqueness of two Classes of Graphs[J].Journal of Mathematical Study,1999,32(3):316-317. |
| |
| Authors: | Wang Shouzhong |
| |
| Abstract: | In this paper, We make use of the properties of adjoint polynomial of graph to give out the necessary and sufficient condition for the chromatic uniqueness of two classes graphs. |
| |
| Keywords: | graph adjoint polynomial chromatically unique graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
