Abstract
A graph G order n is said to have a k?prime labeling, wherek is a positive integer, if the vertices can be labeled with positive integers from k to k+|n|-1 such that each pair of adjacent vertices are relatively prime. In this work, a consecutive cyclic k – prime labeling for ladder graphs is given under certain conditions. Furthermore, a new graph called Crab graph is introduced and a prime labeling is discussed for it.
Keywords
Crab Graph, Ladder Graph, k-prime labeling, prime labeling
Citations
IRE Journals:
M. D. M. C. P. Weerarathna , D. M. T. B. Dissanayake , W. V. Nishadi , K.D.E. Dhananjaya , T. R. D. S. M. Thennakoon; A. A. I. Perera
"Consecutive Cyclic k - Prime Labeling of a Ladder Graphand its application to Crab graph" Iconic Research And Engineering Journals Volume 3 Issue 11 2020 Page 278-283
IEEE:
M. D. M. C. P. Weerarathna , D. M. T. B. Dissanayake , W. V. Nishadi , K.D.E. Dhananjaya , T. R. D. S. M. Thennakoon; A. A. I. Perera
"Consecutive Cyclic k - Prime Labeling of a Ladder Graphand its application to Crab graph" Iconic Research And Engineering Journals, 3(11)
About IRE Journals
IRE Journals is an open access online journals established with an aim to publish high quality of research work in various diciplines. We have more than 6 years in publications. Over 2500+ papers already published.
Important Links
For Authors
Volume 7:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 6:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 5:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 4:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 3:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12