Title of article :
SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH
Author/Authors :
VAIDYA, S.K Saurashtra University - Rajkot - Gujarat, India , ISAAC, RAKHIMOL V Shree M. and N. Virani Science College - Rajkot - Gujarat, India
Abstract :
A total coloring of a graph is a proper coloring in which no two adjacent or
incident graph elements receive the same color. The total chromatic number of a graph
is the smallest positive integer for which the graph admits a total coloring. In this paper,
we derive some results on total chromatic number of a graph.
Keywords :
total coloring , total chromatic number , splitting graph
Journal title :
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
