1 citations
Showing math.COShow all
3 papers · 1 filter
math.CO2012
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
Zhidan Yan, Wei Wang
A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph , denoted by , is the minim…
math.CO2011★ 1 cited
Connectivity of Kronecker products by K2
Wei Wang, Zhidan Yan
Let be the connectivity of . The Kronecker product of graphs and has vertex set and edge set $E(G_1\tim…
math.CO2011
On the edge connectivity of direct products with dense graphs
Wei Wang, Zhidan Yan
Let be the edge connectivity of and the direct product of and . Let be an arbitrary dense graph with minimal degree . We prove that f…