Equitable total chromatic number of splitting graph

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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jayaraman,G., Muthuramakrishnan,D., Manikandan,K.
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2019
Materias:	Equitable total coloring Equitable total chromatic number Splitting graph
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000400699
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172019000400699
record_format	dspace
spelling	oai:scielo:S0716-091720190004006992019-11-04Equitable total chromatic number of splitting graphJayaraman,G.Muthuramakrishnan,D.Manikandan,K. Equitable total coloring Equitable total chromatic number Splitting graph Abstract: Among 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.38 n.4 20192019-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000400699en10.22199/issn.0717-6279-2019-04-0045
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Equitable total coloring Equitable total chromatic number Splitting graph
spellingShingle	Equitable total coloring Equitable total chromatic number Splitting graph Jayaraman,G. Muthuramakrishnan,D. Manikandan,K. Equitable total chromatic number of splitting graph
description	Abstract: Among 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.
author	Jayaraman,G. Muthuramakrishnan,D. Manikandan,K.
author_facet	Jayaraman,G. Muthuramakrishnan,D. Manikandan,K.
author_sort	Jayaraman,G.
title	Equitable total chromatic number of splitting graph
title_short	Equitable total chromatic number of splitting graph
title_full	Equitable total chromatic number of splitting graph
title_fullStr	Equitable total chromatic number of splitting graph
title_full_unstemmed	Equitable total chromatic number of splitting graph
title_sort	equitable total chromatic number of splitting graph
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2019
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000400699
work_keys_str_mv	AT jayaramang equitabletotalchromaticnumberofsplittinggraph AT muthuramakrishnand equitabletotalchromaticnumberofsplittinggraph AT manikandank equitabletotalchromaticnumberofsplittinggraph
_version_	1718439855459926016

Equitable total chromatic number of splitting graph

Ejemplares similares