Square Difference Prime Labeling –More Results on Path Related Graphs
Advances in Mathematics and Computer Science Vol. 4,
Page 134-140
Abstract
Vertices of the graph G are labeled with first p-1 whole numbers, where p is the number of vertices of the graph and edges are labeled with absolute difference of the squares of the labels of the end vertices. If the greatest common divisor of the labels of all edges incident on a vertex of degree greater than one is one then the graph admits square difference prime labeling.
Here we investigate, strong duplicate graph of path, splitting graph of path, tortoise graph of path and some more path related graphs for square difference prime labeling.
Keywords:
- Graph labeling
- prime labeling
- prime graphs
- path related graphs
- square difference
How to Cite
Sunoj, B. S., & Varkey, T. K. M. (2019). Square Difference Prime Labeling –More Results on Path Related Graphs. Advances in Mathematics and Computer Science Vol. 4, 134-140. Retrieved from https://stm1.bookpi.org/index.php/amacs-v4/article/view/649
- Abstract View: 0 times