Journal of East China Normal University(Natural Sc ›› 2009, Vol. 2009 ›› Issue (4): 16-20.

• Article • Previous Articles     Next Articles

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

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

CLC Number: