On Felicitous Labelings of Hn and Hn  Sm graphs

Author:
V. LAKSHMI ALIAS GOMATHI, A. NAGARAJAN and A. NELLAI MURUGAN
Affiliation:

V.O.C College Tuticorin

Keyword:
Graph Labeling, Hn and Hn  Sm, felicitous labeling
Issue Date:
December 2012
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.

Pages:
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
DOI:
Share This:
Facebook Twitter Google Plus LinkedIn Reddit

Copy the following to cite this article:

V. LAKSHMI ALIAS GOMATHI, A. NAGARAJAN and A. NELLAI MURUGAN, "On Felicitous Labelings of Hn and Hn  Sm graphs", Journal of Ultra Scientist of Physical Sciences, Volume 24, Issue 3, Page Number , 2016

Copy the following to cite this URL:

V. LAKSHMI ALIAS GOMATHI, A. NAGARAJAN and A. NELLAI MURUGAN, "On Felicitous Labelings of Hn and Hn  Sm graphs", Journal of Ultra Scientist of Physical Sciences, Volume 24, Issue 3, Page Number , 2016

Available from: https://www.ultrascientist.org/paper/536/

Ansari Education And Research Society
Facebook Google Plus Twitter