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: | , |
|---|---|
| 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!
|
| id |
oai:scielo:S0716-09172019000501071 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720190005010712020-01-07On star coloring of degree splitting of join graphsUlagammal,S.Vivin J.,Vernold Star coloring Complete graph Path and cycle. 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 .info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.38 n.5 20192019-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000501071en10.22199/issn.0717-6279-2019-05-0069 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Star coloring Complete graph Path and cycle. |
| spellingShingle |
Star coloring Complete graph Path and cycle. Ulagammal,S. Vivin J.,Vernold On star coloring of degree splitting of join graphs |
| description |
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 . |
| author |
Ulagammal,S. Vivin J.,Vernold |
| author_facet |
Ulagammal,S. Vivin J.,Vernold |
| author_sort |
Ulagammal,S. |
| title |
On star coloring of degree splitting of join graphs |
| title_short |
On star coloring of degree splitting of join graphs |
| title_full |
On star coloring of degree splitting of join graphs |
| title_fullStr |
On star coloring of degree splitting of join graphs |
| title_full_unstemmed |
On star coloring of degree splitting of join graphs |
| title_sort |
on star coloring of degree splitting of join graphs |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2019 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000501071 |
| work_keys_str_mv |
AT ulagammals onstarcoloringofdegreesplittingofjoingraphs AT vivinjvernold onstarcoloringofdegreesplittingofjoingraphs |
| _version_ |
1718439861908668416 |