| 关于色多项式的若干注记 |
| |
| 引用本文： | 王志雄. 关于色多项式的若干注记[J]. 华侨大学学报(自然科学版), 1993, 14(4): 412-418 |
| |
| 作者姓名： | 王志雄 |
| |
| 作者单位： | 华侨大学管理信息科学系 |
| |
| 摘 要： | 给出若干类型多项式为简单图的色多项式的充分必要条件、连通图和连通双分图的色多项式必须满足的条件,研究图及其补图的色多项式对图特征的描述程度,并提出若干值得进一步探讨的问题。
|
| 关 键 词： | 图 色多项式 连通图 双分图 |
Notes on Chromatic Polynomial |
| |
| Wang Zhixiong. Notes on Chromatic Polynomial[J]. Journal of Huaqiao University(Natural Science), 1993, 14(4): 412-418 |
| |
| Authors: | Wang Zhixiong |
| |
| Affiliation: | Wang Zhixiong Department of Management Information Science |
| |
| Abstract: | In this paper, the author gives the necessary and sufficient condition under which several types of polynomials are the chromatic polynomials of simple graphs, and the condi- tion that the chromatic polynomials of connected graphs and connected bigraphs must satis- fy; and considers the extent to which the chromatic polynomials of graph and its complement describe the characteristic of graph; and finally, proposes some questions worthy of further inquiry. |
| |
| Keywords: | graph chromatic polynomial connectedness bigraph or bipartite graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
