The odd harmonious labelling of nhair-kC 4-snake graph
Khadija Mumtaz, Denny Riama Silaban · Journal of Physics Conference Series · 2021
Abstract Let G(p,q) be graph that consists of p = |V| vertices and q = |E| edges, where is the set of vertices and E is the set of edges of G. A graph G(p,q) is odd harmonious if there exist an injective function f: V → {0, 1, 2, …, 2q − 1} that induced a bijective function f ∗:E → {1, 3, 5, …, 2q − 1} defined by f ∗(uv) = f(u) + f(v). The function f is called harmonious labelling of graph G(p,q). A hair-kC 4 snake graph is a graph obtain by attaching n leaves to vertices of degree two in kC 4-snake graph. In this paper we prove that nhair-kC 4-snake graph is odd harmonious.