K-Graceful, Odd-Even Graceful, Heronian Mean and Analytic Mean Labeling for the Extended Duplicate Graph of Kite Graph
Abstract
In this paper, we investigate the extended duplicate graph of kite graph KI3,m admits K-graceful, Odd-Even graceful, Heronian mean and Analytic mean labeling.
About this article
Keywords
- Graceful
- Kite graph
- Duplicate graph
- Heronian
- Analytic.
References
[1] Gallian JA, “A Dynamic Survey of graph labeling”, the Electronic Journal of combinatories, Vol. 19, # DS6 (2012).
[2] Gnanajothi RB, Topics in Graph Theory, Ph.d, Thesis, Madurai Kamaraj university, India (1991)
[3] Golomb, How to number a graph, in graph theory and computing, RC Read, ed., Acadmic press, Ny, (1997), pp: 23-37.
[4] Sridevi R, naveethakrishnan S, Nagarajan K & Nagarajan A, “Odd-Evengraceful graphs”, J. Appl. math and Informatics, Vol. 30 (2012), pp: 913-923.
[5] Rosa A, “On certain Valuations of the vertices of a graph”, Theory of graphs (Internat. Symposium, Rome, July 1966), Gordon and Breech, N.Y. and Dunodparis, 1967. pp. 349-355.
View more references (4)
[6] Sampathkumar E, “On duplicate graphs”, Journal of the Indian Math. Soc., Vol. 37 (1973), pp: 285-293.
[7] Thirusangu K, Selvam B.& Ulaganathan PP, “Cordial labelings in extended duplicate twig graphs”, International Journal of computer, mathematical sciences and applications, Vol. 4, Nos. 3-4 (2010), pp: 319-328.
[8] Lawrence Rozario Raj P & Vivek K, “Analytic mean labeling of cycle related graphs”, International journal of Innovative science, Engineering and Technology, Vol. 2, Issue 8 (2015).
[9] Sandhya SS, Ebin Raja Merly E & Deepa SD, “Heronian Mean la-beling of Graphs”, International Mathematical Formum, Vol. 12, No. 15 (2017), pp: 705-713.