Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (6): 42-43.

• 研究、探讨 • Previous Articles     Next Articles

Counting of adjoint equivalence graphs of 3-series integers re-set

WANG Qingning,FU Li   

  1. Department of Mathematics,Qinghai Nationality University,Xining 810007,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-02-21 Published:2011-02-21

3-系整数可重集伴随等价图的计数

王青宁,傅 丽   

  1. 青海民族大学 数学系,西宁 810007

Abstract: The number of the adjoint equivalence graphs of re-set which composed by 3-series integers is computed.At the same time,a combination formula for computing the number of the adjoint equivalence graphs of union of paths is given.

Key words: ajoint-polynomial, chromatic-polynomial, adjoint equivalence, chromatic equivalence

摘要: 计算了3-系整数组成的可重集的伴随等价图的个数;给出了路并图伴随等价图个数计算的一个组合公式。

关键词: 伴随多项式, 色多项式, 伴随等价, 色等价