Two Kinds of Graceful Graphs Including K_4 and Their Labeling
Tang Baoxiang · 2001
The graceful labelings of two kinds of graphs including K-4 was gaven.One is K4+Gn+1 graphs,the other is K4+Kn,n graph＇s.So,it＇s proved that K4+Gn+1 graph and K4+Kn,n graph are graceful graphs,and according to K4+Kn,n graph＇s graceful given to the range of the vertes f(m) of the lest graceful graph of edge m is {(1+8m+1)/2}≤f(m)≤{2(m+3-1)}.