Construction of Graceful Signed Graphs

In this paper, the mathematical problem of automation of encoding a communication/transportation network is considered for enabling design of appropriate plans for ground-troopmovement on a complex terrain that motivated to discuss a general method of constructinginfinite families of graceful signed graphs from a given gracefully numbered signed graph. Thismethod gives graceful numberings for signed graphs on K2 + Ktc, t1, where Gc denotes thecomplement of the graph G