References
- I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin., 23 (1987) 201–207.
- I. Cahit, Recent results and open problems on cordial graphs, Contemporary Methods in Graph Theory, 209–230, Bibligraphisches Inst., Mannhiem, 1990.
- Zhen-Bin Gao, Hong-Nan Ren, Sin-Min Lee, Ruo-Yuan Han and Gee-Choon Lau, A new method in finding full friendly indices, Bull. Mal. Math. Sci. Soc. (2016) DOI: 10.1007/s40840–016-0373-8.
- R. K. Guy and F. Harary, On the Möbius ladders, Canad. Math. Bull. 10 (1967), 493–496. doi: 10.4153/CMB-1967-046-4
- H. Kwong, Sin-Min Lee and H. K. Ng, On friendly index sets of 2-regular graphs, Discrete Math., 308 (2008) 5522–5532. doi: 10.1016/j.disc.2007.10.018
- Harris Kwong, Sin-Min Lee and H.K. Ng, On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels, Acta Math. Sinica (English Series), 28 (2012) 661–674. doi: 10.1007/s10114-011-0515-8
- Gee-Choon Lau, Z.B. Gao, S.M. Lee and G.Y. Sun, On friendly index sets of the edge-gluing of complete graph and cycles G(n,3), AKCE J. Graphs. Combin. (2016) DOI: doi:10.1016/j.akcej.2016.06.004.
- Sin-Min Lee and H.K. Ng, On friendly index sets of bipartite graphs, Ars Combin., 86 (2008) 257–271.
- Sin-Min Lee, H.K. Ng and Gee-Choon Lau, On friendly index sets of spiders, Mal. J. Math. Sci., 8(1) (2014) 47–68.
- E. Salehi, PC-labeling of a graph and its PC-set, Bull. Inst. Combin. Appl., 58 (2010), 112–121.
- E. Salehi, S. Churchman, T. Hill and J. Jordan, Product cordial sets of trees, Congr. Numer., 220 (2014) 183–193.
- W. C. Shiu and H. Kwong, Product-cordial index and friendly index of regular graphs, Trans. Comb., 1 (2012), 15–20.
- M. Sundaram, R. Ponraj and S. Somasundaram, Product cordial labeling of graphs, Bull. Pure Appl. Sci. (Sect. E Math. Stat.) 23E (2004), 155–163.
- M. Sundaram, R. Ponraj and S. Somasundaram, On graph labeling parameters, J. Discrete Math. Sci. Cryptogr., 11 (2008), 219–229. doi: 10.1080/09720529.2008.10698179