%0 Journal Article
%T Cyclically Interval Total Coloring of the One Point Union of Cycles
%J Open Journal of Discrete Mathematics
%P 65-72
%@ 2161-7643
%D 2018
%I Scientific Research Publishing
%R 10.4236/ojdm.2018.83006
%X A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v¡ÊV(G) together with v are colored by (dG(v)+1) consecutive colors modulo t, where dG(v) is the degree of the vertex v in G. The one point union of k-copies of cycle Cn is the graph obtained by taking v as a common vertex such that any two distinct cycles C\'n and C\¡¯¡¯n are edge disjoint and do not have any vertex in common except v. In this paper, we study the cyclically interval total colorings of , where n¡Ý3 and k¡Ý2.
%K Total Coloring
%K Interval Total Coloring
%K Cyclically Interval Total Coloring
%K Cycle
%K One Point Union of Cycles
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=84593