Cubic Difference Prime Labeling of Some Tree Graphs

Authors

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

Keywords:

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

Abstract

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.

References

  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.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2017-10-31

Issue

Volume 3, Issue 7, September-October-2017

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
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), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 3, Issue 7, pp.65-68, September-October-2017.