In this paper, using the properties of chromatic polynomial, we discuss the color-partition of the complement of lK 1∪(∪C u i),and characterize the graph with the same color-partition as the class graph under u...In this paper, using the properties of chromatic polynomial, we discuss the color-partition of the complement of lK 1∪(∪C u i),and characterize the graph with the same color-partition as the class graph under u i≠4k+2.展开更多
The parameter R（G） is the function about the front three coeffcients of the adjoint polynomial of graph G. In the paper, the range of R（G） is given when β（G） 〈 β（Dn）, where β（G） is the minimum root of th...The parameter R（G） is the function about the front three coeffcients of the adjoint polynomial of graph G. In the paper, the range of R（G） is given when β（G） 〈 β（Dn）, where β（G） is the minimum root of the adjoint polynomial of graph G and the chromatically equivalent classification of tDn is completely depicted.Furthermore, a sufficient and necessary condition for the class of graphs to be chromatically unique is obtained.展开更多
文摘In this paper, using the properties of chromatic polynomial, we discuss the color-partition of the complement of lK 1∪(∪C u i),and characterize the graph with the same color-partition as the class graph under u i≠4k+2.
基金Supported by the National Science Foundation of China(10761008)Supported by the Science Foundation of the State Education Ministry of China(205170)
文摘The parameter R（G） is the function about the front three coeffcients of the adjoint polynomial of graph G. In the paper, the range of R（G） is given when β（G） 〈 β（Dn）, where β（G） is the minimum root of the adjoint polynomial of graph G and the chromatically equivalent classification of tDn is completely depicted.Furthermore, a sufficient and necessary condition for the class of graphs to be chromatically unique is obtained.
