Open AccessEdge Vertex Prime Labeling for K2,n and K3,n Graphs
Author(s) -
Y M Parmar
Publication year - 2018
Publication title -
mathematical journal of interdisciplinary sciences
Language(s) - English
Resource type - Journals
eISSN - 2278-957X
pISSN - 2278-9561
DOI - 10.15415/mjis.2018.62012
Subject(s) - combinatorics , bipartite graph , vertex (graph theory) , mathematics , enhanced data rates for gsm evolution , prime (order theory) , edge graceful labeling , discrete mathematics , graph , computer science , line graph , graph power , artificial intelligence
In my study, I inspect edge vertex prime labeling of some graphs like complete bipartite graphs K2,n & K 3,n . I proved that the graphs K 2,n for every n & K 3,n for n = 3, 4, …, 29 are edge vertex prime.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom