A NOTE ON NEIGHBOR EXPANDED SUM DISTINGUISHING INDEX

作者：Flandrin Evelyne; Li Hao; Marczyk Antoni^*; Sacle Jean Francois; Wozniak Mariusz

来源：Discussiones Mathematicae - Graph Theory, 2017, 37(1): 29-37.

DOI：10.7151/dmgt.1909

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

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.

• 出版日期2017-2