In this paper we used the cubic roots of unit group together with the concept of cordiality in graph theory to introduce a new method of labeling, this construed cubic cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover, some other properties are investigated and show that the union of any two cycles and the union any two paths are cubic cordial graphs. Also, we study the cubic cordiality for the union of any cycle with a path.
