| 单圈图的伴随多项式的极小根（英文） |
| |
| 引用本文： | 任海珍,高燕玲.单圈图的伴随多项式的极小根（英文）[J].数学研究,2013(4):388-394. |
| |
| 作者姓名： | 任海珍 高燕玲 |
| |
| 作者单位： | [1]厦门大学数学科学学院,厦门福建361005 [2]青海师范大学数学系,西宁青海810008 |
| |
| 基金项目： | supported by NSFC（11061027 11161037）; the Natural Science Foundation of Qinghai Province（2011-Z-907 2011-Z-911） |
| |
| 摘 要： | 引入伴随多项式是为了从补图的角度研究色多形式,图的伴随多项式的极小根可用于判定色等价图.β（G）表示图G的伴随多项式的极小根.n表示n个顶点的单圈图的集合.分别确定了具有max{β（G）｜G∈Ωn}和min{β（G）｜G∈Ωn}的所有单圈图.
|
| 关 键 词： | 色多项式 伴随多项式 单圈图 根 |
On the Minimum Roots of the Adjoint Polynomials of Unicyclic Graphs |
| |
| Ren Haizhen;Gao Yanling.On the Minimum Roots of the Adjoint Polynomials of Unicyclic Graphs[J].Journal of Mathematical Study,2013(4):388-394. |
| |
| Authors: | Ren Haizhen;Gao Yanling |
| |
| Institution: | Ren Haizhen;Gao Yanling;School of Mathematical Sciences, Xiamen University;Department of Mathematics, Qinghai Normal University; |
| |
| Abstract: | The adjoint polynomial was introduced for solving the chromaticity problem of the complements of graphs. The minimum roots of the adjoint polynomials of graphs can be applied to sort out graphs that are not chromatically equivalent. Let β（G） be the minimum root of the adjoint polynomial of the graph G. Denote by n the set of all unicyclic graphs on n vertices. All graphs with max{β（G）｜G ∈Ωn}（resp. min{β（G）｜G ∈Ωn}） are determined. |
| |
| Keywords: | Chromatic polynomial Adjoint polynomial Unicyclic graphs Roots |
| 本文献已被 维普 等数据库收录！ |
