Pell Labeling of Joins of Square of Path Graph

A graph is composed of p vertices and q edges. A Pell labeling graph is the one with ( ) u VG being distinct. Label ( )fu from 0,1,2, … p-1 in a such a way that each edge is labelled with ( ) * f : E G → N such that ( ) ( ) ( ) * f uv = f u + 2 f v are distinct. In this paper we study Square of Pat... View More