| 幂图的点强全色数 |
| |
| 引用本文： | 孟献青. 幂图的点强全色数[J]. 山西师范大学学报：自然科学版, 2013, 0(4): 11-14 |
| |
| 作者姓名： | 孟献青 |
| |
| 作者单位： | 山西大同大学数学与计算机科学学院,山西大同037009 |
| |
| 基金项目： | 山西省高等学校科技研究开发项目（20121015）;山西省青年科技研究基金项目（2013021001-1）. |
| |
| 摘 要： | 图G的一个正常全染色称为图G的点强全染色，当且仅当N[v]中任意元素都染有不同的颜色，其中N[v]={u}uu∈E（G）}U{u}，图G的点强全染色所用颜色的最少数目称为图G的点强全色数．文章通过研究幂图t的结构性质，利用穷染、置换的方法，研究了幂图礴的点强全色数，并给出了一种具体的染色方案．
|
| 关 键 词： | 圈 幂图 点强全染色 点强全色数 |
On the Vertex Strong Total Chromatic Number of Power Graph |
| |
| MENG Xian-qing. On the Vertex Strong Total Chromatic Number of Power Graph[J]. Journal of Shanxi Teachers University, 2013, 0(4): 11-14 |
| |
| Authors: | MENG Xian-qing |
| |
| Affiliation: | MENG Xian-qing ( School of Mathematics and Computer Sciences, Shanxi Datong University, Datong 037009, Shanxi, China) |
| |
| Abstract: | A proper total coloring of the graph G is said to be a vertex strong total coloring, if and only if any element in N[v] are colored with different colors, where N[v] = t u I uv E E（G）/ U {v}. The least number of the vertex strong colors is called the vertex strong total chromatic number. According to the properties of power graph, using color one by one and recursion, the vertex strong total coloring chromatic number of power graph Pkn is studied, at the same time, a coloring method is given. |
| |
| Keywords: | circle power graph vertex strong total coloring vertex strong total chromatic number |
| 本文献已被 维普 等数据库收录！ |
