Advances and Applications in Discrete Mathematics
Volume 18, Issue 4, Pages 473 - 480
(October 2017) http://dx.doi.org/10.17654/AADMOct2017_473_480 |
|
EQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHS
S. K. Vaidya and Rakhimol V. Isaac
|
Abstract: The equitable coloring is a variant of proper coloring. The graph G is called equitably k-colorable if the vertex set can be partitioned into k non empty independent sets such that for every i and j. The smallest integer k for which G is equitably k-colorable is called the equitable chromatic number of G and is denoted by The present work is aimed to investigate equitable chromatic number of some wheel related graphs. |
Keywords and phrases: proper coloring, chromatic number, equitable coloring, equitable chromatic number. |
|
Number of Downloads: 298 | Number of Views: 1053 |
|