Edge Vertex Prime Labeling of Union of Graphs
M. Simaringa1, S. Muthukumaran2
1M. Simaringa, Department of Mathematics, Thiru Kolanjiappar Govt. Arts College, Virudhachalam (Tamil Nadu), India.
2S. Muthukumaran, Department of Mathematics, Siga College of Management and Computer Science, Virudhachalam (Tamil Nadu), India.
Manuscript received on 15 December 2019 | Revised Manuscript received on 22 December 2019 | Manuscript Published on 31 December 2019 | PP: 89-97 | Volume-9 Issue-1S6 December 2019 | Retrieval Number: A10171291S619/19©BEIESP | DOI: 10.35940/ijeat.A1017.1291S619
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 is said to be an edge vertex prime labeling if its vertices and edges are labeled with distinct positive numbers not exceeding such that for any edge and are pairwise relatively prime. We prove that some class of union of graphs such as is even for and when and one point union of wheel and cycle related graphs are edge vertex prime.
Keywords: Edge Vertex Prime Labeling, Relatively Prime, Star, Path, Cycle, One Point Union of Graphs.
Scope of the Article: Graph Algorithms and Graph Drawing