Hexagonal Difference Prime Labeling of Some Path Graphs

Authors

  • B S Sunoj Government Polytechnic College, Attingal
  • Mathew T K Varkey T K M College of Engineering, Kollam

DOI:

https://doi.org/10.12723/mjs.42.4

Keywords:

Graph labeling, Hexagonal Numbers, Greatest Common incidence Number, Path

Abstract

Hexagonal difference prime labeling of vertices of a graph is the labeling of the vertices of the graph with hexagonal numbers and the edges with absolute value of the difference of the labels of the incident vertices. The greatest common incidence number (gcin) of a vertex of degree greater than one is defined as the greatest common divisor of the labels of the incident edges. If the gcin of each vertex of degree greater than one is 1, then the graph admits hexagonal difference prime labeling.  Here we identify some path related graphs for hexagonal difference prime labeling.

Author Biographies

B S Sunoj, Government Polytechnic College, Attingal

Department of Mathematics, Government Polytechnic College, Attingal, Kerala

Mathew T K Varkey, T K M College of Engineering, Kollam

Department of Mathematics, T K M College of Engineering, Kollam 691 005

References

[1] T. M. Apostol, Introduction to Analytic Number Theory, New Delhi: Narosa, 1998.
[2] F. Harary, Graph Theory. Reading, MA: Addision-Wesley, 1969.
[3] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic Journal of Combinatorics, DS6, pp 1-408, 2016.
[4] T. K. M. Varkey, “Some Graph Theoretic Generations Associated with Graph Labeling,” Ph.D. dissertation, Univ. Kerala, Thiruvanthapuram, 2000.

Additional Files

Published

2017-05-29

Issue

Vol. 16 No. 3 (2017): Mapana Journal of Sciences

Section

Research Articles