Some Properties of Graceful Graph
Yao Bing · Shuxue de shijian yu renshi · 2012
For a(p,q)-graph G,if it there is an injection from V(G) to {0,1,……,q} such that the set of all edge labels is equal to {1,2,…,q},where the label of an edge uv of G is f(uv) = |f(u)—f(v)|,then G is called a graceful graph,and f is a graceful labelling of G.In this paper,though research server graph get some graceful graph's properties.