Show simple item record

On star coloring of degree splitting of join graphs

dc.creatorUlagammal, S.
dc.creatorVivin J., Vernold
dc.date2019-12-18
dc.date.accessioned2020-01-06T17:47:53Z
dc.date.available2020-01-06T17:47:53Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/3910
dc.identifier10.22199/issn.0717-6279-2019-05-0069
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/122182
dc.descriptionA 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 Pn, complete graph Kn and cyclevgraph Cn.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/3910/3313
dc.rightsDerechos de autor 2019 S. Ulagammal, Vernold Vivin J.es-ES
dc.rightshttp://creativecommons.org/licenses/by/4.0es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 38 No 5 (2019); 1071-1080en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 38 Núm. 5 (2019); 1071-1080es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectStar coloringen-US
dc.subjectComplete graphen-US
dc.subjectPath and cycleen-US
dc.subject05C15en-US
dc.subjectColoring of graphs and hypergraphsen-US
dc.subject05C75en-US
dc.subjectStructural characterization of families of graphsen-US
dc.titleOn star coloring of degree splitting of join graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record