华东师范大学学报(自然科学版) ›› 2009, Vol. 2009 ›› Issue (4): 16-20.

• 应用数学与基础数学 • 上一篇    下一篇

图的邻点可区别边划分(英)

卞西燕, 苗连英, 尚华辉, 段春燕, 马国翼   

  1. 中国矿业大学~~数学系, 江苏~徐州 221008
  • 收稿日期:2008-03-09 修回日期:2008-09-02 出版日期:2009-07-25 发布日期:2009-07-25
  • 通讯作者: 卞西燕

Adjacent vertex-distinguishing edge partition of graphs

BIAN Xi-yan, MIAO Lian-ying, SHANG Hua-hui DUAN Chun-yan, MA Guo-yi

  

  1. Department of Mathematics, China University of Mining and Technology, Xuzhou}}\DWEI{{\it Jiangsu} 221008
  • Received:2008-03-09 Revised:2008-09-02 Online:2009-07-25 Published:2009-07-25
  • Contact: BIAN Xi-yan

PDF

1430

摘要： 研究了图的邻点可区别边划分所需要的最少边色数. 通过对图的度进行分类讨论,
证明了不包含$K_{2}$且最小度$\geqslant188$的图有邻点可区别点染色3边划分.
这个结论比已有结果更优越

关键词: 边划分, 邻点可区别, 非正常, 边划分, 邻点可区别, 非正常

Abstract: he minimum number of colors required to give a graph $G$ an adjacent
vertex-distinguishing 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.

Key words: adjacent vertex-distinguishing, non-proper , edge partition, adjacent vertex-distinguishing, non-proper

中图分类号: