Super graceful labeling for some simple graphs

Let $G$ be a $(p,q)$ - graph. A bijective function $f:V(G)cup E(G)rightarrow {1,2,...,p+q}$ such that $f(uv)=leftvert f(u)-f(v) rightvert$ for every edge $uv epsilon E(G)$ is said to be a super graceful labeling. A graph $G$ is called a super graceful graph if it admits a super graceful labeling. In this paper, we show that the graphs $P_n, P_m odot nK_{1}, P^{+}_{n}-e_{0}$, and $C_n $ are super graceful graphs.