| 引用本文： |
-
孔令峰,苏文龙,罗海鹏,黎贞崇,何建东.Pn2的Mycielski图的邻强边色数和邻点可区别全色数[J].广西科学,2008,15(1):4-6. [点击复制]
- KONG Ling-feng,SU Wen-long,LUO Hai-peng,LI Zhen-chong,HE Jian-dong.Adjacent Strong Edge Colorly and Aadjacent-vertex-distinguishing-total Coloring of the Mycielski Graph of Pn2[J].Guangxi Sciences,2008,15(1):4-6. [点击复制]
|
|
| 摘要: |
| 定义新图Pn2,并在n ≥ 3时,确定Pn2的Mycielski图的邻强边色数和邻点可区别全色数,构造一个M(Pn2)的邻点可区别全染色法. |
| 关键词: 图论 邻强边色数 邻点可区别全色数 Mycielski图 |
| DOI： |
| 投稿时间：2007-10-09 |
| 基金项目:国家自然科学基金项目(60563008);广西自然科学基金项目(桂科自0728051)资助 |
|
| Adjacent Strong Edge Colorly and Aadjacent-vertex-distinguishing-total Coloring of the Mycielski Graph of Pn2 |
|
KONG Ling-feng1, SU Wen-long2, LUO Hai-peng3, LI Zhen-chong3, HE Jian-dong3
|
| (1.Department of Mathematics and Computer Science, Guangxi Teachers Education University, Nanning, Guangxi, 530023, China;2.Wuzhou College, Wuzhou, Guangxi, 543002, China;3.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China) |
| Abstract: |
| A new graph of Pn2 was defined, the adjacent strong edge chromatic number and adjacent vertex distinguishing total chromatic number, and construct the coloring method of adjacent vertex distinguishing total coloring of the graph of Mycielski of graph Pn2 also be confirmed when n ≥ 3. |
| Key words: graph theory adjacent strong edge chromatic number the adjacent vertex distinguishing total chromatic number Mycielski graph |
