This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Square Difference Prime Labeling for Some Tree Graphs
Authors
Sunoj B S, Mathew Varkey T K
Abstract
Square 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 squares 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 square difference prime labeling. Here we identify some trees for square difference prime labeling.
Keywords- Graph labeling, square difference, greatest common incidence number, prime labeling, trees.
Publication Details
Unique Identification Number - IJEDR1704142Page Number(s) - 875-878Pubished in - Volume 5 | Issue 4 | November 2017DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Sunoj B S, Mathew Varkey T K, "Square Difference Prime Labeling for Some Tree Graphs", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.5, Issue 4, pp.875-878, November 2017, Available at :http://www.ijedr.org/papers/IJEDR1704142.pdf
Article Preview
|
|
||||||
|
|
||||||||
