1. Gallian, J. A. (2014). A dynamic survey of graph labeling. The Electronic journal of combinatorics, 17, 60–62.
2. Cahit, I. (1987). Cordial graphs-a weaker version of graceful and harmonious graphs. Arscombinatoria, 23, 201– 207.
3. Rosa, A. (1966, July). On certain valuations of the vertices of a graph. In Theory of Graphs (Internat. Symposium, Rome (pp. 349–355).
4. Sundaram, M., Ponraj, R., &Somasundaram, S. (2004). Product cordial labeling of graphs. Bull. Pure and Appl. Sci.(Math. & Stat.) E, 23, 155–163.
5. Sundaram, M., Ponraj, R., &Somasundram, S. (2006). Total product cordial labeling of graphs. Bull. Pure Appl. Sci. Sect. E Math. Stat, 25, 199–203.