@article{Ulagammal_Vivin J._2019, title={On star coloring of degree splitting of join graphs}, volume={38}, url={https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3910}, DOI={10.22199/issn.0717-6279-2019-05-0069}, abstractNote={A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number χ s (G) of G is the least number of colors needed to star color G. In this paper, we have generalized the star chromatic number of degree splitting of join of any two graph G and H denoted by G + H, where G is a path graph and H is any simple graph. Also, we determine the star chromatic number for degree splitting of join of path graph G of order m with path P n , complete graph K n and cyclevgraph C n .}, number={5}, journal={Proyecciones (Antofagasta, On line)}, author={Ulagammal, S. and Vivin J., Vernold}, year={2019}, month={Dec.}, pages={1071-1080} }