Show simple item record

Equitable total chromatic number of splitting graph

dc.creatorJayaraman, G.
dc.creatorMuthuramakrishnan, D.
dc.creatorManikandan, K.
dc.date2019-10-14
dc.date.accessioned2019-11-14T12:01:22Z
dc.date.available2019-11-14T12:01:22Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/3799
dc.identifier10.22199/issn.0717-6279-2019-04-0045
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113713
dc.descriptionAmong the varius coloring of graphs, the concept of equitable total coloring of graph G is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is called its equitable total chromatic number. In this paper, we determine an equitable total chromatic number of splitting graph of Pn, Cn and K1,n.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/3799/3245
dc.rightsDerechos de autor 2019 G. Jayaraman, D. Muthuramakrishnan, K. Manikandanes-ES
dc.rightshttps://creativecommons.org/licenses/by/4.0es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 38 No 4 (2019); 699-705en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 38 Núm. 4 (2019); 699-705es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectEquitable total coloringen-US
dc.subjectEquitable total chromatic numberen-US
dc.subjectSplitting graphen-US
dc.subjectColoring of graphs and hypergraphsen-US
dc.subject05C15en-US
dc.titleEquitable total chromatic number of splitting graphen-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