The Odd-Even graceful labeling of a graph G with $q$ edges means that there is an injection $f:V (G)$ to ${1,3,5,{cdots},2q+1}$ such that, when each edge $uv$ is assigned the label ${mid}f(u)-f(v){mid}$, the resulting edge labels are ${2,4,6,{cdots},2q}$. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, we prove that some well known graphs namely $P_n$, $P_n^+$, $K_{1,n}$, $K_{1,2,n}$, $K_{m,n}$, $B_{m,n}$ are Odd-Even graceful.