The odd harmonious labelling of n hair-kC4-snake graph

K. Mumtaz, D. R. Silaban

Research output: Contribution to journalConference articlepeer-review

Abstract

Let G(p, q) be graph that consists of p = |V} vertices and q = |E| 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 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 / is called harmonious labelling of graph G(p, q). A hair-kC4 snake graph is a graph obtain by attaching n leaves to vertices of degree two in kC4-snake graph. In this paper we prove that nhair-kC4-snake graph is odd harmonious.

Original languageEnglish
Article number012089
JournalJournal of Physics: Conference Series
Volume1725
Issue number1
DOIs
Publication statusPublished - 12 Jan 2021
Event2nd Basic and Applied Sciences Interdisciplinary Conference 2018, BASIC 2018 - Depok, Indonesia
Duration: 3 Aug 20184 Aug 2018

Keywords

  • Cycle graph
  • Odd harmonious labelling
  • Snake graph

Fingerprint

Dive into the research topics of 'The odd harmonious labelling of n hair-kC<sub>4</sub>-snake graph'. Together they form a unique fingerprint.

Cite this