一类稠密图色唯一的充要条件  

Necessary and Sufficient Condition of Chromatic Uniqueness of a Class of Dense Graphs

作　　者：詹福琴[1] 乔友付[1] 

机构地区：[1]河池学院数学系,广西宜州546300

出　　处：《中北大学学报（自然科学版）》2013年第1期10-16,共7页Journal of North University of China(Natural Science Edition)

基　　金：国家自然科学基金项目(10761008);广西教育厅科研项目(201010LX471;201010LX495);河池学院科研项目(2011YBZ-N003;2012YBZ-N004)

摘　　要：设n≥1,T(1,1,n,4,1)表示从Pn+1的两个端点分别引出两条长为1,1和4,1的路所得到的图.在图G伴随唯一当且仅当-G色唯一的基础上,利用图的特征标、伴随多项式的代数性质及最小实数根的规律,证明了一类稠密图T(1,1,n,4,1)色唯一的充要条件是n≠1,4,7.On the basis of graph G is adjointly unique if and only if is chromatically unique,it is mainly proved that for n≥1,a class of dense graphs T（1,1,n,4,1） is chromatically unique if and only if n≠1,4 and 7,by using the character,the algebraic properties of adjoint polynomial and distribution pattern of the minimum real roots of graph＇s,where T（1,1,n,4,1） denotes the graph with a path of length n＋1,and from each end-vertex of this path its are drawn two paths of length 1,1 and two paths of length 4,1,respectively.

关 键 词：伴随多项式 伴随唯一 色唯一 特征标 最小实数根 

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