图(∪a_iD_(3m_i))(from i=1 to s)∪(∪b_jD_(3n_j+1))(from j=1 to t)的补图的色唯一性  

Chromatic Uniqueness of the Complents of[WT4BZ] (∪si=1a iD 3 m i )∪(∪tj=1b jD 3n j+1 )

作　　者：景占策[1] 

机构地区：[1]青海师范大学数学系,青海西宁810008

出　　处：《青海师范大学学报（自然科学版）》2001年第2期4-8,共5页Journal of Qinghai Normal University(Natural Science Edition)

基　　金：国家自然科学基金

摘　　要：本文证明了Dn是不可约图的充分条件。并讨论了图G =(∪si=1aiD3mi)∪ (∪tj=1bjD3nj+1)的伴随唯一性。Let Pn denote The path of order n,Let Dn be the graph obtained by indentifying a Vertex of K 3 with a 1-degree vertex of Pn-2,Let U n=k≤n-1n-1+kk(kn-1-k),In the present orticle,we prove Dn is irredueible graph if n=3m or 3m+1 and [(u n-1)!+1]/u n is a positive integer,m∈N and the complements of (∪si=1a iD 3m i )∪(∪tj=1b jD 3n j+1 ) which satisfied some cordition is chromatically unigue,we improve The reswlts obtained by Lin Ruying in[1].

关 键 词：伴随多项式 递归数列 不可约图 色多项式 色唯一性 补图 

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