| 图和色多项式根2的阶 |
| |
| 引用本文： | 臧运华.图和色多项式根2的阶[J].数学研究及应用,2001,21(1):148-152. |
| |
| 作者姓名： | 臧运华 |
| |
| 作者单位： | 宁波大学管理学系, |
| |
| 摘 要： | 本文证明了3-连通非偶图的色多项式根2的阶为1;满足一定条件的非3-连通非偶图的色多项式根2的阶是图的非偶块和非偶可分块数.从而，把色多项式P(G)中1的阶是图G的非平凡块数这一结果进一步加以推广.
|
| 关 键 词： | 色多项式 块 可分块 非偶可分块. |
| 文章编号： | 1000-341X(2001)01-0148-05 |
| 收稿时间： | 1998/4/28 0:00:00 |
| 修稿时间： | 1998年4月28日 |
Graph and the Multiplicity of Root 2 in the Chromatic Polynomial |
| |
| ZANG Yun-hua.Graph and the Multiplicity of Root 2 in the Chromatic Polynomial[J].Journal of Mathematical Research with Applications,2001,21(1):148-152. |
| |
| Authors: | ZANG Yun-hua |
| |
| Institution: | Department of Management, Ningbo University, 315211, China |
| |
| Abstract: | In this paper, it was proved that the multiplicity of the root 2 in the chromatic polynomial of 3-connected non-even graph is 1; and it is showed that the multiplicity of the root 2 in the chromatic polynomial of non-3-connected graph with definite conditions is equal to the number of non-even blocks and non-even separable blocks. Therefore, it was spreaded that the multiplicity of the root 1 in the chromatic polynomial of a simple graph G is equal to the numble of nontrivial blocks in G. |
| |
| Keywords: | chromatic polynomial block separable block non-even separable block |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
