The equitable chromatic number of the total graph and central graph of a spider
Yuehua Bu · Journal of Zhejiang Normal University · 2011
The property of the total graph and central graph of a spider were discussed,by giving the certain in dependent set,it was proved that if graph G was a spider then it contained n paths with the length of n-1 after removing the head.Let T(G) denote the total graph of G,then the equitable chromatic number of the total graph of GχEq=n+1.Let C(G) denote the central graph of G,the equitable chromatic number of the central graph of G was also obtained: χEq =2k2+1 when n=2k,χEq=2k2+3k+1 when n=2k+1.