Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6872537 | Discrete Applied Mathematics | 2014 | 6 Pages |
Abstract
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 G, denoted by Ï=(G), is the minimum k such that G is equitably k-colorable. The equitable chromatic threshold of a graph G, denoted by Ï=â(G), is the minimum t such that G is equitably k-colorable for kâ¥t. In this paper, we give the exact values of Ï=(Km1,â¦,mrÃKn) and Ï=â(Km1,â¦,mrÃKn) for âi=1rmiâ¤n.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Zhidan Yan, Wei Wang,