RT Journal Article
SR Electronic
T1 EQUITABLE CHROMATIC THRESHOLD OF CENTRAL GRAPHS
JF JCR
JO Journal of Critical Reviews
FD Innovare Academics Sciences
SP 1744
OP 1747
DO 10.31838/jcr.07.05.297
VO 7
IS 5
A1 LouraJency
A1 Benedict Michael Raj
YR 2020
UL http://www.jcreview.com/?mno=109461
AB : Graph coloring is a process of assigning colors to the vertices of a graph. It is used in various fields such as sudoku, register allocation, scheduling and networking. Equitable coloring is one such type of coloring which is introduced by Meyer in 1973. This type of coloring plays a major role in scheduling and timetabling. The equitable chromatic threshold of a graph G, denoted by χ= ∗ (G), is the minimum t such that G is equitably k − colorable for all k ≥ t. In this paper we find equitable chromatic threshold number of central graph of path, cycle, star and complete bipartite graphs.