Math. J. Interdiscip. Sci.

Edge Vertex Prime Labeling for K2,n and K3,n Graphs

Yamini M Parmar

  • Download PDF
  • DOI Number
    https://doi.org/10.15415/mjis.2018.62012
KEYWORDS

Complete bipartite graph; edge vertex prime labeling; graph labeling; prime labeling.

PUBLISHED DATE March 2018
PUBLISHER The Author(s) 2018. This article is published with open access at www.chitkara.edu.in/publications
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.

Page(s) 167–180
URL http://dspace.chitkara.edu.in/jspui/bitstream/123456789/697/1/MJIS006_Yamani.pdf
ISSN Print : 2278-9561, Online : 2278-957X
DOI https://doi.org/10.15415/mjis.2018.62012
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 labeling 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 labeling of Graphs, National Academy Science Letters, 11 (1982), 365–368.