Open AccessThe Vertex Prime Valuation for Jahangir and Theta Graphs
Author(s) -
R. Anantha Lakshmi*,
K. Jayalakshmi
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l3754.1081219
Subject(s) - combinatorics , valuation (finance) , mathematics , vertex (graph theory) , discrete mathematics , graph , finance , economics
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.