On star coloring of degree splitting of join graphs

Abstract 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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Ulagammal,S., Vivin J.,Vernold
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2019
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000501071
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Abstract 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 .