AN UPPER BOUND OF THE SMARANDACHELY-ADJACENT-VERTEX ACYCLIC EDGE COLORING OF GRAPHS
Liu Wang-fa · Xitong kexue yu shuxue · 2013
In the paper,the concept of the Smarandachely-adjacent-vertex acyclic edge coloring of graphs is proposed,and the relationship between Smarandachelyadjacent -vertex acyclic edge coloring and adjacent vertex distinguishing acyclic edge coloring is discussed.An upper bound of the Smarandachely-adjacent-vertex acyclic edge coloring of graphs with no isolated edges is obtained by the way of probablity.