摘要
本文给出了任何简单图G(V, E)的色多项式 系数之和的 公式 并进行了证明,从而为判别一个多项式不是图的色多项式提供了一个必要条件.同时也分别给出了树、2-树、圈、轮图和完全图的色多项式系数绝对值之和的表达式。最后证明了任何简单连通图的色多项式系数绝对值之和 与边数 成正比。
In this paper, it is proved that the sum of chromatic coefficients of any simple graphs
must be The expressions of the absolute sum of chromatic coefficients
of some families of graphs, such as trees, 2-trees, cycles, wheels and complete graphs, are
given. Finally, it is proved that the absolute sum of chromatic coefficients of any simple
connected graphs varies directly as εand must satisfy
出处
《运筹学学报》
CSCD
北大核心
2003年第3期67-74,共8页
Operations Research Transactions
