16Jan 2019

LINEAR PRIME LABELING OF SOME DIRECT CYCLE RELATED GRAPHS.

  • Department of mathematics, government polytechnic college, attingal.
  • Department of mathematics, t k m college of engineering, kollam.
Crossref Cited-by Linking logo

  • Abstract
  • Keywords
  • References
  • Cite This Article as
  • Corresponding Author

Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct edges with twice the value of the terminal vertex plus value of the initial vertex. The greatest common incidence number of a vertex (gcin) of in 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 in degree greater than one is one, then the graph admits linear prime labeling. Here we investigated some direct cycle related graphs for linear prime labeling.

  1. Apostol. Tom M, Introduction to Analytic Number Theory, Narosa, (1998).
  2. F Harary, Graph Theory, Addison-Wesley,Reading, Mass, (1972).
  3. Joseph A Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics(2015), #DS6,Pages 1 ? 389.
  4. T K Mathew Varkey, Some Graph Theoretic Operations Associated with Graph Labelings, PhD Thesis,University of Kerala 2000.

[Sunoj B S and Mathew Varkey T K. (2019); LINEAR PRIME LABELING OF SOME DIRECT CYCLE RELATED GRAPHS. Int. J. of Adv. Res. 7 (Jan). 1019-1026] (ISSN 2320-5407). www.journalijar.com

SUNOJ B S
GOVERNMENT POLYTECHNIC COLLEGE ATTINGAL

DOI:

Article DOI: 10.21474/IJAR01/8417      
DOI URL: https://dx.doi.org/10.21474/IJAR01/8417

Download Full Paper

Download PDF No. of Downloads: 52 | No. of Views: 132