Odd harmonis labeling of friendship graphs (f_{n,4})and graphs K(1,nC4)
Maulina Puspitasari Pangestri and Purwanto

Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Malang,
Jalan Semarang 5, Malang, 65145, Indonesia

Abstract

Let G be a finite graph having a vertex set v(G) and set edge set E(G), and |E(G)|=q. An odd harmonious labeling of G is an injection mapping f:V(G) \rightarrow {0,1,2,...,2q-1} such that f*:E(G)\rightarrow{1,3,5,...,2q-1}, where f*(uv)=f(u)+f(v), is a bijection. If a graph can be labeled an odd elegant labeling, then the graph is said to be odd harmonious. A generalized friendship graph f_{n,4} is a collection of n 4-cycles meeting at common vertex. A graphs K(1,nC4) is a graphs formed from t copies of the cycle graph C_{4}by joining all the copies to anew vertex by an edge. In this paper, we study odd harmonious labeling of (f_{n,4})and graphs K(1,nC4)

Keywords: odd harmonious, friendship graph and graphs K_{1,n}^{4}

Topic: Mathematics