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...
Guardado en:
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!
|
Ejemplares similares
-
Star edge coloring of corona product of path and wheel graph families
por: Kaliraj,K., et al.
Publicado: (2018) -
ON HARMONIOUS COLORING OF TOTAL GRAPHS OF C(Cn), C(K1,n) AND C(Pn)
por: Vivin J,Vernold, et al.
Publicado: (2010) -
On r− dynamic coloring of the gear graph families
por: Deepa,T., et al.
Publicado: (2021) -
L(1,1)-Labeling of Direct Product of any Path and Cycle
por: Olayide Ajayi,Deborah, et al.
Publicado: (2014) -
Equitable total chromatic number of splitting graph
por: Jayaraman,G., et al.
Publicado: (2019)