图 K2n+1\E（K1,m）的点可区别全染色
On Vertex-Distinguishing Total Coloring of K2n+1\E (K 1,m)
-
摘要: 图的点可区别全染色是满足任意两个顶点色集合不相同的正常全染色,所用的最少颜色数被称为图的点可区别全色数。应用构造染色函数法研究了图 K 2n+1\E(K 1,m )(n≥2,m≥2)的点可区别全色数。Abstract: A vertex distinguishing coloring of graph is a proper total coloring such that no two distinctverti-ces,whose color set are identical.The minimal number of colors required for the coloring is called the ver-texdistinguishing total coloring chromatic number.In this paper,the vertex distinguishing total chromatic number of K 2n+1\E(K 1 ,m )(n≥2,m≥2)has been discussed by constructing the coloring functions.
-
-
计量
- 文章访问数: 653
- HTML全文浏览数: 457
- PDF下载数: 2
- 施引文献: 0
下载: