•  
  •  
 

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.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

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

Share

COinS