Volume 37 | Number 1 | Year 2016 | Article Id. IJMTT-V37P510 | DOI : https://doi.org/10.14445/22315373/IJMTT-V37P510
In this paper we discussed about balanced V4-cordial labeling. We proved that , and are balanced V4 -cordial graphs, when G is a balanced V4-cordial graph.
[1]I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, ArsCombin., 23,(1987) pp. 201 - 207.
[2] F. Harary, Graph Theory, Addition Wesley, Massachusetts, (1972).
[3] J. A. Gallian, A dynamic Survey of graph labeling, The electronics J. Combin., 17, # DS6, (2014).
[4] Riskin, - Cordiality of and arxiv:0709.0290 (2013).
[5] V.J.Kaneria,Kalpesh M.Patadiya and Jaydev R.Teraiya, Balanced Cordial Labeling and its Application to Produce new Cordial Families,International Journal of Mathematics And its Applications,Volume 4,Issue 1-C,65-68(2016).
[6] V.J.Kaneria,Jaydev R.Teraiya and Kalpesh M.Patadiya, Some Result on Balanced Cordial on Balanced Cordial Graph, International Journal of Mathematics And its Applications, Volume 4,Issue2-A,85-87(2016).
V. J. Kaneria, Jaydev R. Teraiya, "Some V4 -cordial families with its balanced V4- cordial labeling," International Journal of Mathematics Trends and Technology (IJMTT), vol. 37, no. 1, pp. 73-75, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V37P510