Cubic Difference Prime Labeling of Some Tree Graphs

Authors(2) :-Sunoj B S, Mathew Varkey T K

Cubic difference prime labeling of a graph is the labeling of the vertices with {0,1,2-------,p-1} and the edges with absolute difference of the cubes of the labels of the incident vertices. The greatest common incidence number of a vertex (gcin) 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 one, then the graph admits cubic difference prime labeling. Here we identify some tree graphs for cubic difference prime labeling.

Authors and Affiliations

Sunoj B S
Department of Mathematics, Government Polytechnic College, Attingal, Kerala, India
Mathew Varkey T K

Graph Labeling, Cubic Difference, Greatest Common Incidence Number, Prime Labeling, Trees.

  1. Apostol. Tom M, Introduction to Analytic Number Theory, Narosa, (1998).
  2. F Harary, Graph Theory, AddisonWesley,Reading, Mass, (1972)
  3. Joseph A Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics(2016), #DS6, pp 1 - 408.
  4. T K Mathew Varkey, Some Graph Theoretic Generations Associated with Graph Labeling, PhD Thesis, University of Kerala 2000.

Publication Details

Published in : Volume 3 | Issue 7 | September-October 2017
Date of Publication : 2017-10-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 65-68
Manuscript Number : IJSRST173714
Publisher : Technoscience Academy

Print ISSN : 2395-6011, Online ISSN : 2395-602X

Cite This Article :

Sunoj B S, Mathew Varkey T K, " Cubic Difference Prime Labeling of Some Tree Graphs, International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 3, Issue 7, pp.65-68, September-October-2017. Available at doi : 10.32628/IJSRST173714
Journal URL : http://ijsrst.com/IJSRST173714

Article Preview

Contact Us