Prime labeling of torch graph
Downloads
Abstract
Let $G=(V(G), E(G))$ be a graph with $n$ vertices. A bijection $f: V(G) \rightarrow\{1,2, \ldots, n\}$ is called a prime labeling if for each edge $e=u v, g c d(f(u), f(v))=1$. A graph which admits prime labeling is called a prime graph. In this paper we prove that Torch graph $O_n$ is a prime graph.
Keywords:
Prime Labeling, Duplication, Torch GraphMathematics Subject Classification:
Mathematics- Pages: 890-895
- Date Published: 01-01-2021
- Vol. 9 No. 01 (2021): Malaya Journal of Matematik (MJM)
R. Anantha Lakshmi, K.Jayalakshmi and T. Madhavi, prime Labeling of Jahangir Graphs, International Journal of Engineering & Technology, 7(4.10)(2018), 389-392.
J.A. Bondy and U.S.R. Murthy, Graph Theory and Applications, North Holland, New York 1976.
A. Delman, S. Koilraj, P.Lawrence Rozario Raj, Neighbourhood prime labeling of some special graphs,International Journal of Pure and Applied Mathematics, 120(4)(2018), 601-607.
A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinations,(2019),#6.
Jona Martinus Manulang and Kiki Ariyanti Sugeng, Graceful labeling on torch graph, Indonesian Journal of Combinatorics, 2(1)(2018), 14-19.
L. Meenakshi Sundaram and A. Nagarajan, Prime Labeling of Some Special Class of graphs, Ultra Scientist, $28(4)(mathrm{A})(2016), 208-212$.
A.Tout, A.N. Dabboucy and K. Howalla, Prime labeling of graphs, Nat. Acad. Sci letters, 11(1982), 365-368.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
