Contents

-

Some a-Graphs and Odd Graceful Graphs

M.A. Seoud1, E.F. Helmi1
1Department of Mathematics, Faculty of Science, Ain Shams University, Abbassia, Cairo, Egypt.

Abstract

We show that if G has an odd graceful labeling f such that max{f(x):f(x) is even,xA}<min{f(x):f(x) is odd,xB}, then G is an o-graph, and if G is an a-graph, then GKn is odd graceful for all w1. Also, we show that if G1 is an a-graph and G2 is an odd graceful, then G1G2 is odd graceful. Finally, we show that some families of graphs are a-graphs and odd graceful.