| 图的邻点可区别边划分(英) |
| |
| 引用本文： | 卞西燕,苗连英,尚华辉,段春燕,马国翼.图的邻点可区别边划分(英)[J].华东师范大学学报(自然科学版),2009,2009(4):16-20. |
| |
| 作者姓名： | 卞西燕 苗连英 尚华辉 段春燕 马国翼 |
| |
| 作者单位： | 中国矿业大学,数学系,江苏,徐州,221008 |
| |
| 摘 要： | 研究了图的邻点可区别边划分所需要的最少边色数. 通过对图的度进行分类讨论, 证明了不包含$K_{2}$且最小度$\geqslant188$的图有邻点可区别点染色3边划分. 这个结论比已有结果更优越
|
| 关 键 词： | 边划分 邻点可区别 非正常 边划分 邻点可区别 非正常 |
| 收稿时间： | 2008-3-9 |
| 修稿时间： | 2008-9-2 |
Adjacent vertex-distinguishing edge partition of graphs |
| |
| BIAN Xi-yan,MIAO Lian-ying,SHANG Hua-hui,DUAN Chun-yan,MA Guo-yi.Adjacent vertex-distinguishing edge partition of graphs[J].Journal of East China Normal University(Natural Science),2009,2009(4):16-20. |
| |
| Authors: | BIAN Xi-yan MIAO Lian-ying SHANG Hua-hui DUAN Chun-yan MA Guo-yi |
| |
| Institution: | Department of Mathematics;China University of Mining and Technology;Xuzhou Jiangsu 221008;China |
| |
| Abstract: | The minimum number of colors required to give a graph G an adjacent vertexdistinguishing edge partition was studied.Based on the classification of the degree of a graph,this paper proved that every graph without K_2 of minimum degree at least 188 permits an adjacent vertex-distinguishing 3-edge partition.The result is more superior than previous ones. |
| |
| Keywords: | edge partition adjacent vertex-distinguishing non-proper |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《华东师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《华东师范大学学报(自然科学版)》下载免费的PDF全文 |
