On Hamming Gracefulness of Graphs
Bu Chang · Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University · 2000
We gave one necessary condition of Hamming_graceful graph,proved that the graphs were Hamming_graceful ,which Hamming_graceful graph G appended any tree to any vertex of G,and also proved that graph G∪T were Hamming_graceful,which T was any tree and G was any Hamming_graceful graph (G≠K 2).