On difference graphs

ISSN: 08353026
Citations of this article
Mendeley users who have this article in their library.


We show that if G has an odd graceful labeling f such that max{f (x) : f (x) is even, x epsilon A} < min{f (x) : f (x) is odd, x epsilon B}, then G is an alpha-graph, and if G is an alpha-graph, then G circle dot <(K)over bar>(w) is odd graceful for all w >= 1. Also we show that if G(1) is an alpha-graph and G(2) is an odd graceful, then G(1) boolean OR G(2) is odd graceful. Finally we show that some families of graphs are alpha-graphs and odd graceful.




Seoud, M. A., & Helmi, E. F. (2011). On difference graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 76, 189–199.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free