| 连通图的色多项式的一次项系数的若干性质 |
| |
| 引用本文： | 宋长新. 连通图的色多项式的一次项系数的若干性质[J]. 青海师范大学学报(自然科学版), 1997, 0(2): 14-17 |
| |
| 作者姓名： | 宋长新 |
| |
| 摘 要： | 本文讨论了连通图的色多项式的一次项系数ａ１的一些性质。当－│ａ１│＝１，图Ｇ是树；当│ａ１│≥２时，图Ｇ有圈；当│ａ１│＝２时，图Ｇ是含有一个圈且只有含有一个三点圈的图；当│ａ１│＝３时，图Ｇ是含有一个圈且只含一个四点圈的图。
|
| 关 键 词： | 连通图 色多项式 一次项系数 |
Certain Characteristics Concerning the Monomial Coefficient of the Color Palymonial of a Connected Graph |
| |
| Song Changxin. Certain Characteristics Concerning the Monomial Coefficient of the Color Palymonial of a Connected Graph[J]. Journal of Qinghai Normal University(Natural Science Edition), 1997, 0(2): 14-17 |
| |
| Authors: | Song Changxin |
| |
| Affiliation: | Department of Computer |
| |
| Abstract: | The present artiale deals with certain characteristics concerning the monomial coefficiental in the color. polymonial of a connected graph. When la, |a1|=1,graph G is a tree. When |a1|= 2,graph G is a graph containing a circle and only containing a circle with three points.When |a1|=3, graph G Contains a circle and only contains a circle of four points. |
| |
| Keywords: | Connected graph of a color polymonial Monomial coefficient |
| 本文献已被 CNKI 维普 等数据库收录！ |
