  In an attempt to prove the Graceful Tree Conjecture, we present two
propagation of graphs. The first is to propagate graceful graphs, and the
second is to propagate trees from a gracefully labeled tree. The motivation in
propagating such graphs is to see how graphs behave in the lens of their
adjacency matrices. Thus, we provide the necessary algorithms for the said
objectives.
