Abstract Paper
Journal of
Computational Mathametica
| Title | : Equitable Coloring of Some Cycle Related Graphs |
|---|---|
| Author(s) | : 1 S. K. Vaidya,2 Rakhimol and 3 V. Isaac |
| Article Information | : , 32-38 |
| Affiliation(s) | : 1,2 Department of Mathematics, Saurashtra University, Rajkot - 360005, Gujarat, India |
| : 3 Department of Mathematics, Christ College, Rajkot - 360005, Gujarat, India. |
Abstract :
The graph is called equitably k-colorable if the vertex set of the graph can be partitioned into k non empty independent sets V1; V2; : : : ; Vk such that jVij jVj j 1, for every i and j. The smallest integer k for which the graph G is equitably k- colorable is called the equitable chromatic number of graph G and is denoted by e(G). If the connected graph G is neither a complete graph nor an odd cycle then the Equitable Coloring Conjecture (ECC) states that e(G) 4(G). In this work we investigate the equitable chromatic number of some cycle related graphs like middle graph, shadow graph and splitting graph of cycle.
| Keywords | : Equitable coloring, Equitable chromatic number, Middle graph, Shadow graph, Splitting graph. |
|---|---|
| Document Type | : Research Paper |
| Publication date | : May 20, 2017 |