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