报告摘要：
| A neighbor sum distinguishing k-edge coloring of a graph G is a proper edge coloring of G using colors in {1,…,k} such that the sum of colors of the edges incident to u is different from the sum of the colors of the edges incident to v for any uv in E(G). The neighbor sum distinguishing index ndisum (G) of G is the minimum value of k such that G has a neighbor sum distinguishing k-edge coloring. An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that for any pair of adjacent vertices, the sets of colors appearing on the vertex and incident edges are different. The adjacent vertex distinguishing total chromatic number is the minimum number of colors required for an adjacent vertex distinguishing total coloring χ”a(G) of G. In this talk, we will survey some results on these coloring problems.
|
