@article{Jayaraman_Muthuramakrishnan_Manikandan_2019, title={Equitable total chromatic number of splitting graph}, volume={38}, url={https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3799}, DOI={10.22199/issn.0717-6279-2019-04-0045}, abstractNote={<p>Among the varius coloring of graphs, the concept of equitable total coloring of graph <em>G</em> is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is called its equitable total chromatic number. In this paper, we determine an equitable total chromatic number of splitting graph of P<sub>n</sub>, C<sub>n</sub> and K<sub>1,n</sub>.</p>}, number={4}, journal={Proyecciones (Antofagasta, On line)}, author={Jayaraman, G. and Muthuramakrishnan, D. and Manikandan, K.}, year={2019}, month={Oct.}, pages={699-705} }