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:
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!