1 research outputs found
On r-equitable chromatic threshold of Kronecker products of complete graphs
A graph is -equitably -colorable if its vertex set can be
partitioned into independent sets, any two of which differ in size by at
most . The -equitable chromatic threshold of a graph , denoted by
, is the minimum such that is -equitably
-colorable for all . Let denote the Kronecker product
of graphs and . In this paper, we completely determine the exact value
of for general and . As a consequence, we
show that for , if then and its spanning supergraph have the same -equitable
colorability, and in particular , where is the complete -partite graph
with vertices in each part