APPLICATIONS OF GRACEFUL GRAPHS

A simple graph G is an ordered pair of a non - empty set V of objects called vertices together with the set E of edges e=uv, u,v ? V, where p = |V| and q= |E|. If f:V → {0,1,...,q} is an injective mapping and f*(uv)=|f(u) ? f(v)| ? uv ? E. If f* (E) = { 1,2,...,q) then f is called a graceful labeling of G and the graph which admits such numbering is called graceful graphs. This paper discuss the applications of graceful labeling of some graphs in radio - astronomy, development of missile guidance codes, spect ral characterization of material using X - ray crystallography