A Note on Neighbor Expanded Sum Distinguishing Index

Abstract

A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices.

Keywords

• general edge coloring
• total coloring
• neighbor-distinguishing index
• neighbor sum distinguishing coloring
• 05c15