A Complete Solution to the Chromatic Equivalence Class of Graph B_(n-8,1,4) |
| |
Abstract: | 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). |
| |
Keywords: | |
本文献已被 CNKI 等数据库收录! |
|