C_n∪U_m的色等价类  

The Graphs with the Same Chromatic Partitions as the Complement of ■

作　　者：王波[1] 

机构地区：[1]青海师范大学数学与信息科学系,青海西宁81008

出　　处：《甘肃联合大学学报（自然科学版）》2006年第6期12-16,22,共6页Journal of Gansu Lianhe University :Natural Sciences

摘　　要：应用图的伴随多项式理论完整地刻画了与Cn∪Um的补图有相同色划分的图,其中Cn表示n个顶点的圈,Um表示由Pm-4的两个1度点分别与两个P3的2度点边接得到的图.Let C. be a cycle with n vertices and Um be the graph obtained by identifying two vertices of degree 2 of P3 with two vertices of degreel of Pm-4 . By using the theory of adjoint polynomials,it is completely characterized all graphs having the same chromatically equivalent classification with the complement graphs of Cn ∪ Um.

关 键 词：伴随多项式 色等价 最小根 

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