On Odd Average Harmonious Labeling of Graphs

Authors

Porpattama Hammachukiattikul, Department of Mathematics, Phuket Rajabhat University, Phuket 83000, ThailandFollow
Grienggrai Rajchakit, Department of Mathematics, Faculty of Science, Maejo University, Sansai 50290, Chiang Mai, ThailandFollow
Vediyappan Govindan, Department of Science and Humanities DMI - St John The Baptist University, P.O Box. 406, Mangochi, Malawi, Central AfricaFollow
S. Dhivya, Department of Mathematics, Sri Vidya Mandir Arts & Science College, Katteri, Uthangarai, IndiaFollow
Nallappan Gunasekaran, Department of Mathematical Sciences, Shibaura Institute of Technology, Saitama 337-8570, JapanFollow
R. Vadivel, Department of Mathematics, Phuket Rajabhat University, Phuket 83000, ThailandFollow

Author Country (or Countries)

Thailand

Abstract

The present paper investigates new idea of odd average harmonious labelling. A function h is known as odd average harmonious labelling of graph G(V,E) with nodes of n and lines of m if h : V(G) → {0,1,2,...,n} is injective and the initiated function h∗ : E(G) → {0,1,2,...,(m−1)} is characterized as h∗(uv)=􏰟h(u)+h(v)+1􏰠(mod m)∀uv∈E(G) 2 the resultant edge names will be clearly bijective. A graph that calls for an odd average harmonious labelling is called an odd average harmonious graph.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/150201

Recommended Citation

Hammachukiattikul, Porpattama; Rajchakit, Grienggrai; Govindan, Vediyappan; Dhivya, S.; Gunasekaran, Nallappan; and Vadivel, R. (2021) "On Odd Average Harmonious Labeling of Graphs," Applied Mathematics & Information Sciences: Vol. 15: Iss. 2, Article 1.
DOI: http://dx.doi.org/10.18576/amis/150201
Available at: https://digitalcommons.aaru.edu.jo/amis/vol15/iss2/1