References
- I.CahitCordial graphs: a weaker version of graceful and harmonious graphsArs Combin.231987201207
- G.ChartrandSin-MinLeeP.ZhangUniformly cordial graphsDiscrete Math.3062006726737
- Y.S.HoSin-MinLeeH.K.NgOn friendly index sets of root-unions of stars by cyclesJ. Combin. Math. Combin. Comput.62200797120
- S.KuoG.J.ChangH.KwongCordial labeling of Discrete Math.169199713
- H.KwongSin-MinLeeH.K.NgOn friendly index sets of 2-regular graphsDiscrete Math.308200855225532
- Sin-MinLeeA.LiuA construction of cordial graphs from smaller cordial graphsArs Combin.321991209214
- Sin-MinLeeH.K.NgOn friendly index sets of bipartite graphsArs Combin.862008257271
- Sin-MinLeeH.K.NgGee-ChoonLauOn friendly index sets of spidersMal. J. Math. Sci.8120144768
- E.SalehiSin-MinLeeFriendly index sets of treesCongr. Numer.1782006173183
- E.SeahOn the construction of cordial graphsArs Combin.311991249254
- S.C.SheeY.S.HoThe cordiality of one-point union of copies of a graphDiscrete Math.1171993225243
- N.CairnieK.EdwardsThe computational complexity of cordial and equitable labellingDiscrete Math.21620002934
Further reading
- Y.S.HoSin-MinLeeS.S.SheeCordial labellings of the Cartesian product and composition of graphsArs Combin.291990169180
- M.HoveyA-cordial graphsDiscrete Math.931991183194