Lh Labeling of Some Graphs
Farisa M1, Parvathy K.S2

1Farisa M, Research Scholar, St. Mary’s College, Thrissur (Kerala), India.
2Dr. Parvathy K. S, Associate Professor, Post Graduate and Research, Department of Mathematics, St. Mary’s College, Thrissur (Kerala), India.
Manuscript received on 30 March 2019 | Revised Manuscript received on 09 April 2019 | Manuscript Published on 27 April 2019 | PP: 874-878 | Volume-7 Issue-6S2 April 2019 | Retrieval Number: F11020476S219/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: A graph G with n vertices is said to have an LH Labeling if there exists a bijective function f : V(G) → {1,2,3,…,|V(G)|} such that the induced map f* : E(G) → N, the set of natural numbers defined by f* (uv) = is injective. ( LCM and HCF denotes the least common multiple and highest common factor respectively). A graph that admits an LH labeling is called an LH graph. In this paper we prove that the splitting graphs of a path, comb and theta, sparkler graph and H graph are LH graphs.
Keywords: Graph Labeling, H Graph, Splitting Graph, Theta Graph.
Scope of the Article: Cryptography and Applied Mathematics