Abstract
In this paper, we show that if G is an "alpha-labeled" graph and if H is a "pseudograceful" graph, then G boolean OR H can be graceful or "pseudograceful" under some conditions on the alpha-labeling function of G. This generalizes Theorem 2.1 of [7]. We also show that if G is a Skolem-graceful, then G + (K) over bar (n) is graceful for all n greater than or equal to 1. We also give a partial answer to the question in [1] about the gracefulness of (K) over bar (n) + mK(2) for m greater than or equal to 3. Finally, we complete the characterization of graceful graphs in the family C-m boolean OR S-n.