三类连通图的伴随唯一性  

Adjoint Uniqueness of Three Families of Connected Graphs

作　　者：崔立彦[1] 赵连昌[2] 马晓娟[3] 

机构地区：[1]东北大学理学院,辽宁沈阳110006 [2]大连海事大学基础部,辽宁大连116026 [3]沈阳建筑工程学院

出　　处：《东北大学学报（自然科学版）》2000年第2期218-221,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目 !( 198710 0 7) ;辽宁省教委高校科研项目 !( 963 5 3 2 12 3 9)

摘　　要：在寻找色唯一图中 ,使用图的伴随多项式而不使用色多项式可以得到某些结果·表示n点n +2边连通图中伴随多项式的第三个系数达到其最大值且第四个系数达到其最小值的三类图组成的图族 ,本文给出这三类图伴随唯一 ,从而它们的补图色唯一的充分条件·In the research for chromatically unique graphs, some new results could be obtained by using the adjoint polynomials instead of using the chromatic polynomials of these graphs. Let Γ 0 0 be the family of connected graphs with n vertices and n+2 edges whose third and fourth coefficients of adjoint polynomial have the maximum value and the minimum value, respectively. The family Γ 0 0 consists of three subfamilies. The sufficient conditions were established for the three subfamilies to be adjoint uniqueness. Their complement graphs were proved to be chromatic uniqueness subsequently.

关 键 词：连通图 伴随唯一 色唯一 

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