References
- D.B.WestIntroduction to Graph Theorysecond ed.2003Prentice-HallNew Jersey, USA
- I.CahitCordial graphs: a weaker version of graceful and harmonious graphsArs Combin.231987201207
- Y.S.HoS.C.SheeThe cordiality of one-point union of n copies of a graphDiscrete Math.1171993225243
- W.W.KirchherrNEPS operations on cordial graphsDiscrete Math.1151993201209
- S.M.LeeA.LiuA construction of cordial graphs from smaller cordial graphsArs Combin.321991209214
- I.CahitOn cordial and 3-equitable labelings of graphsUtil. Math.371990189198
- K.L.CollinsM.HoveyMost graphs are edge-cordialArs Combin.301990289295
- M.HoveyA-cordial graphsDiscrete Math.931991183194
- Y.S.HoS.M.LeeS.C.SheeCordial labelings of the Cartesian product and composition of graphsArs Combin.291990169180
- W.W.KirchherrOn the cordiality of some specific graphsArs Combin.311991127137
- D.KuoG.J.ChangY.H.H.KwongCordial labeling of mKnDiscrete Math.1691997121131
- M.SundaramR.PonrajS.SomasundaramProduct cordial labeling of graphsBull. Pure Appl. Sci. Sect. E Math. Stat.232004155163
- S.K.VaidyaC.M.BarasaraEdge product cordial labeling of graphsJ. Math. Comput. Sci.25201214361450
- S.K.VaidyaC.M.BarasaraTotal edge product cordial labeling of graphsMalaya J. Mat.3120135563
- A.AzaizehR.HasniA.AhmadG.C.Lau3-total edge product cordial labeling of graphsFar East J. Math. Sci.9622015193209