We show that if has an odd graceful labeling such that , then is an o-graph, and if is an a-graph, then is odd graceful for all . Also, we show that if is an a-graph and is an odd graceful, then is odd graceful. Finally, we show that some families of graphs are a-graphs and odd graceful.