Abstract
In this paper, we give a necessary condition for an odd degree graph to be Skolem-graceful and we prove that if G is a (p, q) pseudograceful graph such that p = q + 1, then G boolean OR S-m is Skolem-graceful for all in >= 1 and finally we give some variations on the definition of cordial graphs.