Edge Vertex Prime Labeling for K2,n and K3,n Graphs
Abstract:
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.
Author(s):
Yamini M Parmar, Govt. Engg. College, Sector-28, Gandhinagar, Gujarat, India.
DOI:
Keywords:
References:
D. M Burton, Elementary Number Theory, Brown Publishers, Second Edition, (1990).
J. A. Gallian, A dynamic Survey of Graph labeling, The Electronics Journal of Combinatorics, 12(2017), #DS6.
J. Gross, J.Yellen, Graph theory and its Applications, CRC Press, (2005).
R. Jagadesh, J.Baskar Babujee, Edge vertex prime labelling for some class of graphs, National Conference on Recent Trends in Mathematics and its Applications, SRM University, Vadapalani, Chennai, India, 2(2017).
Y. M. Parmar, Edge Vertex Prime Labeling for Wheel, Fan and Friendship Graph, International Journal of Mathematics and Statistics Invention, 10 (2017), 23–29.
A. Tout, A. N. Dabboucy, K. Howalla, Prime labelling of Graphs, National Academy Science Letters, 11 (1982), 365–368.
