计算机工程与应用Issue(22)：52-54,3.DOI:10.3778/j.issn.1002-8331.1302-0163
一类图的色唯一性
Chromatic uniqueness of a class graphs
摘要
Abstract
Two graphs are chromatically equivalent if they have the same chromatic polynomials. A graph is said to be chromati-cally unique if each graph which has same chromatic polynomial is isomorphic with it. Similarly, two graphs are adjointly equiv-alent if they have the same adjoint polynomials. A graph is said to be adjointly unique if each graph which has same adjoint poly-nomial is isomorphic with it. As we all know, two graphs are chromatically equivalent if their complement are adjointly equivalent;a graph is chromatically unique if its complement is adjointly unique. In this paper, a necessary and sufficient condition of a classe graphs adjointly unique is given, thus a necessary and sufficient condition of their complement chromatically unique is given.关键词
色多项式/伴随多项式/色唯一/伴随唯一Key words
chromatic polynomial/adjoint polynomial/chromatic uniquness分类
信息技术与安全科学引用本文复制引用
魏岭..一类图的色唯一性[J].计算机工程与应用,2013,(22):52-54,3.
