SQUARE DIFFERENCE PRIME LABELING –MORE RESULTS ON PATH RELATED GRAPHS

Full Article - PDF

Published: 2018-01-03

Page: 117-123


B. S. SUNOJ *

Department of Mathematics, Government Polytechnic College, Attingal, India.

T. K. MATHEW VARKEY

Department of Mathematics, TKM College of Engineering, Kollam, India.

*Author to whom correspondence should be addressed.


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. (2018). SQUARE DIFFERENCE PRIME LABELING –MORE RESULTS ON PATH RELATED GRAPHS. Asian Journal of Mathematics and Computer Research, 22(3), 117–123. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/1197

Downloads

Download data is not yet available.