图和色多项式根2的阶  

Graph and the Multiplicity of Root 2 in the Chromatic Polynomial

作　　者：臧运华[1] 

机构地区：[1]宁波大学管理学系,浙江宁波315211

出　　处：《Journal of Mathematical Research and Exposition》2001年第1期148-152,共5页数学研究与评论（英文版）

摘　　要：本文证明了３－连通非偶图的色多项式根２的阶为１；满足一定条件的非３－连通非偶图的色多项式根２的阶是图的非偶块和非偶可分块数．从而，把色多项式Ｐ（Ｇ）中１的阶是图Ｇ的非平凡块数这一结果进一步加以推广．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.

关 键 词：色多项式 可分块 非偶可分块 图 根 简单图 非偶块 

分 类 号：O157.[理学—数学] 5[理学—基础数学]