Author:
Mumtaz K,John P,Silaban D R
Abstract
Abstract
Let G(p, q) be a graph that consists of p vertices and q edges, where V is the set of vertices and E is the set of edges of G. A graph G(p, q) is odd harmonious if there exists an injective function f that labels the vertices of G by integer from 0 to 2q − 1 that induced a bijective function f
∗ defined by f
∗(uν) = f(u) + f(ν) such that the labels of edges are odd integer from 1 to 2q − 1. A graph that admits harmonious labeling is called a harmonious graph. A matting graph is a chain of C
4 −snake graph. A matting graph can be view as a variation of the grid graph. In this paper, we prove that the matting graph is an odd harmonious graph.
Subject
General Physics and Astronomy
Reference10 articles.
1. On the odd harmonious graphs with applications;Liang;J. Appl. Math. Comput,2009
2. The odd harmonious labeling of kCn −snake graphs for spesific values of n, that is, for n = 4 and n = 8;Alyani,2013
3. Odd harmonious labelings of cyclic snakes;Abdel-Aal;J. Graph-Hoc,2013
4. Odd harmonious labeling of grid graph;Jeyanti;Proyecciones,2019
5. Odd harmonious labeling on squid graph and double squid graph;Febriana;Journal of Physics: Conference Series,2020