摘要
图G的色惟一性与补图各分支的不可约性密切相关 .用Pn 表示n阶的路 ,证明了n≥ 4时 ,Pn 是不可约图当且仅当n + 1是素数 ,从而得出若干新的色惟一图 .
Chromatic uniqueness of graphs has a close relation with irreducibility of each component of complementary graph. Let P n denote the path of n vertices. In this paper, it has shown that P n is irreducible graph if and only if n+1 is prime when n≥4 . And some new chromatically unique graphs were obtained also.
出处
《东北师大学报（自然科学版）》
CAS
CSCD
北大核心
2001年第2期18-21,共4页
Journal of Northeast Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目 ( 1 0 0 61 0 0 3 )
青海省教委资助项目 ( 2 0 0 0~ 2 0 0 1 )
