中北大学学报（自然科学版）2011，Vol.32Issue(3)：253-259,7.DOI:10.3969/j.issn.1673-3193.2011.03.003
一类稠密图色性的刻画
Characterization for the Chromaticity of a Class of the Dense Graphs
摘要
Abstract
In allusion to a large number of non-chromatically unique graphs, the chromaticity of a class of the dense graphs is studied by applying the properties of graph's adjoint polynomial, minimum roots and character features. The chromatically equivalent classes of the dense graphs are completely characterized, and the chromatically unique sufficient and necessary condition of the graphs is obtained. The new tools and methods are provided for the chromaticity research of graphs.关键词
色等价/色唯一/伴随多项式/伴随等价/伴随唯一/最小根Key words
chromatically equivalent) chromatically uniqueness/ adjoint polynomial/ adjoint equivalent/adjoint uniqueness/ minimum root分类
数理科学引用本文复制引用
詹福琴,乔友付,罗美金..一类稠密图色性的刻画[J].中北大学学报（自然科学版）,2011,32(3):253-259,7.基金项目
国家自然科学基金资助项目(10761008) （10761008）
广西自然科学基金资助项目(桂科自0991265) （桂科自0991265）
广西教育厅科研项目(200911LX402) （200911LX402）
河池学院科研项目(2009A-N004,N005 （）
2008QS-N007,N008) （）
