Antimagic Labeling of Pumpkin Graph
DOI:
https://doi.org/10.48165/Keywords:
Antimagic labeling, Pumpkin GraphAbstract
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, . . . , q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. A graph which admits an antimagic labeling is called an antimagic graph. In this paper, we prove that the Pumpkin graph admit antimagic labeling.
References
Alon N, Kaplan G, Lev A, Roditty Y, and Yuster R (2004). Dense graphs are antimagic, Journal of Graph Theory.
Basher M (2021). k-Zumkeller labeling of super subdivision of some graphs, Journal of the Egyptian Mathematical Society.
Dharmendra Kumar G, Auparajita K (2022). International Journal of Scientific Research in Mathematical and Statistical Sciences 9(3), 11-18.
Frank Harary (1971). Graph Theory, Addison Wesley series in Mathematics, Addison-Wesley.
Gallian J A (2013). A dynamic survey of graph labeling, The Electronics Journal of Combinatorics.
Hartsfield N and Ringel G (1990). Pearls in Graph Theory, Academic Press, San Diego.
Hong Yang, Muhammad Aamer Rashid, Sarfraz Ahmad, Muhammad Kamran Siddiqui and Muhammad Farhan Hanif (2019). Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs, Journal of Discrete Mathematical Sciences and Cryptography.
Prasanna NL (2014). Applications of Graph Labeling in Communication Networks, Orient, J. Comp. Sci. and Technology 7(1).
Krishnaa A (2016). Some Applications of Labelled Graphs, International Journal of Mathematics Trends and Technology (IJMTT), 37(3).
Rosa A (1967). On certain valuations of the vertices of a graph, Theory of Graphs,(International Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris.