The Vertex Prime Valuation for Jahangir and Theta Graphs
R. Ananthalakshmi1, K. Jayalakshmi2
1R. Anantha Lakshmi, Research Scholar, Department of Mathematics, Jawaharlal Nehru Technological University Ananthapur, Andhra Pradesh, India.
2K. Jayalakshmi, Associate Professor, Department of Mathematics, Jawaharlal Nehru Technological University Ananthapur, Andhra Pradesh, India.
Manuscript received on September 16, 2019. | Revised Manuscript received on 24 September, 2019. | Manuscript published on October 10, 2019. | PP: 5019-5021 | Volume-8 Issue-12, October 2019. | Retrieval Number: L37541081219/2019©BEIESP | DOI: 10.35940/ijitee.L3754.1081219
Open Access | Ethics and 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 sequence of instructions which can help to solve a problem is called an algorithm. The reason for composing an algorithm is to reduce the timespan and understanding the solution of problems in simple way. In this paper, vertex prime valuation of the Jahangir graph Jn,m for n ≥ 2, m ≥ 3 and generalized Theta graph θ (l1 , l 2 , l 3 , …, ln) has been investigated by using algorithms .We discuss vertex prime valuation of some graph operations on both graphs viz. Fusion, Switching and Duplication, Disjoint union and Path union.
Keywords: Prime Labeling, Jahangir Graph, Theta Graph, Fusion, Switching and Duplication, Disjoint Union and Path Union.
Scope of the Article: Graph Algorithms and Graph Drawing