| 完全二部图广义Mycielski图的邻点可区别全色数与邻强边色数 |
| |
| 引用本文： | 李沐春,强会英,晁福刚,张忠辅. 完全二部图广义Mycielski图的邻点可区别全色数与邻强边色数[J]. 数学的实践与认识, 2008, 38(19) |
| |
| 作者姓名： | 李沐春 强会英 晁福刚 张忠辅 |
| |
| 基金项目： | 国家自然科学基金 ， 甘肃省教委基金 |
| |
| 摘 要： | 得到了完全二部图Km,n的广义Mycielski图Ml(Km,n),当(l≥1,n≥m≥2)时的邻点可区别全色数与邻强边色数.
|
| 关 键 词： | 完全二部图 广义Mycielski图 邻点可区别全色数 邻强边色数 |
On The Adjacent-Vertex-Distinguishing Total Chromatic Number and The Adjacent-Strong-Edge Chromatic Number of Genera Mycielski Graph of Km,n |
| |
| LI Mu-chun,QIANG Hui-ying,CHAO Fu-gang,ZHANG Zhong-pu. On The Adjacent-Vertex-Distinguishing Total Chromatic Number and The Adjacent-Strong-Edge Chromatic Number of Genera Mycielski Graph of Km,n[J]. Mathematics in Practice and Theory, 2008, 38(19) |
| |
| Authors: | LI Mu-chun QIANG Hui-ying CHAO Fu-gang ZHANG Zhong-pu |
| |
| Abstract: | The adjacent vertex distinguishing total chromatic numbers, and the adjacent strong edge chromatic numbers of General Mycielski of complete 2-partite graph Ml(Km,n)(l≥1,n≥m≥2) be obtained. |
| |
| Keywords: | complete 2-partite graph general Mycielski graph adjacent-vertex distinguishing total coloring adjacent-strong-edge coloring |
| 本文献已被 万方数据 等数据库收录！ |
|
