学术
国际标准刊号：ISSN 1007-6093
国内统一刊号：CN 31-1732
摘 要:
本文推广已有图Dn。Fn到两类新图Dn^i：Fn^i（i≥4），并运用与色和有关的代数函数一伴随函数得到它们的伴随多项式并讨论了当i=4时的不可约性．[著者文摘]
文章出处:
《运筹学学报》-2007年11卷3期 -11-20页
OR Transactions
分 类 号:
Adjoint Polynomials of Two Kinds of Graphs
Du Juan, Hao Rongxia, Li Hongqi（1. School of Economics and Management, Beijing University of Aeronautics ＆ Astronautics, Beijing 100083, China;2. Department of Mathematics, Northern Jiaotong University, Beijing 100044, China）
Abstract:
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.[著者文摘]
Key words:
Operations research, graphs, adjoint polynomial, irreducibility, chromatically unique
收稿日期: 2005-11-17
基金资助:
Supported by foundation of Beijing Jiaotong University （2004SM054） and the National Natural Science Foundation of China （60373030;10271017）.
更多评论>>文章评论
更多>>免费文章
cqvip.com