On Felicitous Labelings of Hn and Hn Sm graphs

**ABSTRACT:**

A simple graph G is called felicitous if there exists a 1 – 1 function f : V(G) {0,1,2, . . . , q} such that the set of induced edge labels f *(uv) = (f(u) + f(v)) (mod q) are all distinct. In this paper, Hn and Hn Sm graphs are shown to be felicitous.

**KEYWORDS: **Graph Labeling, Hn and Hn Sm, felicitous labeling

**DOI:**jusps-A

**[XML]****[HTML]****VIEW COUNT:**716**DOWNLOAD PDF****TOTAL DOWNLOADS**

A simple graph G is called felicitous if there exists a 1 – 1 function f : V(G) {0,1,2, . . . , q} such that the set of...