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

Counting of Adjoint Equivalence Graphs of 2K-Series Integers Reset

作　　者：王青宁[1] 

机构地区：[1]青海民族大学数学学院,青海西宁810007

出　　处：《数学的实践与认识》2012年第21期257-261,共5页Mathematics in Practice and Theory

基　　金：教育部春晖计划(Z2006-1-81001);国家民委09QH02

摘　　要：给出了由2k-系的整数组成的可重集的伴随等价图的个数问题,同时也给出了其补图的色等价图的个数.In this paper, we determine the number of the adjoint equivalence graphs of re-set which composed by 2k-series integers. At the same time, we also give a combination formula for computing the number of the chromatic equivalence graphs of its complement graph.

关 键 词：伴随多项式 色多项式 伴随等价 色等价 

分 类 号：O157.5[理学—数学]