摘要
本文推广已有图D_n,F_n到两类新图D_n^i,F_n^i(i≥4),并运用与色和有关的代数函数—伴随函数得到它们的伴随多项式并讨论了当i=4时的不可约性.
In this paper, we generalize graphs D., F. to two new kinds of graphs i i Dn^i, Fn^i, for i≥4, and obtain their adjoint polynomials by using algebraic function termed the adjoint function corresponding to chromatic sum. Futhermore, we discuss their irreducibilities in the case of i = 4.
出处
《运筹学学报》
CSCD
北大核心
2007年第3期11-20,共10页
Operations Research Transactions
基金
Supported by foundation of Beijing Jiaotong University(2004SM054)
the National Natural Science Foundation of China(60373030 10271017)
关键词
运筹学
图论
伴随多项式
不可约性
色唯一
Operations research, graphs, adjoint polynomial, irreducibility, chromatically unique
