In this work, we prove that the theta graph (Tα), Duplication of any vertex of degree 3 in Tα, path union of r copies of Tα, one point union of r(Tα), the fusion of any two vertices of Tα, switching of a central vertex in Tα are Cube difference labeling.

Keywords : Cube Difference Labeling (CDL), Fusion, Duplication, Switching, Path Union, One Point Union. AMS Subject Classification: 0578.