Volume 7 | Number 2 | Year 2014 | Article Id. IJMTT-V7P512 | DOI : https://doi.org/10.14445/22315373/IJMTT-V7P512
In this paper, the duplication of arbitrary vertex vk of cycle Cn (n ≥ 3),
[1] J. Baskar Babujee, “Planar graphs with maximum edges anti-magic property”, The Mathematics Education, Vol 4, No. 37, pp. 194-198, 2003.
[2] I. Cahit, “Cordial graphs: A weaker version of graceful and harmonious graphs”, Ars Combinatoria, Vol 23, pp. 201-207, 1987.
[3] David M. Burton, Elementary Number Theory, Second Edition, Wm. C. Brown Company Publishers, 1980.
[4] F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1972.
[5] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 19, # DS6, 2012.
[6] M.Sundaram, R.Ponraj and S.Somasundaram, “Prime cordial labeling of graphs”, Journal of Indian Academy of Mathematics, Vol 27, pp.373-390, 2005.
[7] S. K. Vaidya and N. H. Shah, “Some Star and Bistar Related Divisor Cordial Graphs”, Annals of Pure and Applied Mathematics, Vol 3, No.1, pp. 67-77, 2013.
[8] S. K. Vaidya and N. H. Shah, “Further Results on Divisor Cordial Labeling” Annals of Pure and Applied Mathematics Vol. 4, No.2, 2013, pp. 150-159
[9] R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, “Divisor cordial graphs”, International J. Math. Combin., Vol 4, pp. 15-25, 2011.
[10] R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, “Special classes of divisor cordial graphs”, International Mathematical Forum, Vol 7, No. 35, pp. 1737-1749, 2012.
P. Lawrence Rozario Raj , R. Valli, "Some New Families of Divisor Cordial Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 7, no. 2, pp. 94-102, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V7P512