• 대한수학회논문집
• /
• 제30권1호
• /
• pp.45-64
• /
• 2015

In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak [15] first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus 3. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.