| 6 | A Complete Solution to the Chromatic Equivalence Class of Graph B_(n-8,1,4)显示文摘Two graphs are defined to be adjointly equivalent if and only if their complements are chromatically equivalent.Using the properties of the adjoint polynomials and the fourth character R_4(G),the adjoint equivalence class of graph B_(n-8,1,4) is determined.According to the relations between adjoint polynomial and chromatic polynomial,we also simultaneously determine the chromatic equivalence class of B_(n-8,1,4) that is the complement of B_(n-8,1,4). | Yaping MAO Chengfu YE Shumin ZHANG | 2012 | Journal of Mathematical Research with Applications2012，32，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员