Open AccessPell Labeling of Joins of Square of Path Graph
Author(s) -
S. Sriram,
R. Govindarajan,
K. Thirusangu
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1074.1291s319
Subject(s) - combinatorics , joins , graph , join (topology) , mathematics , path (computing) , square (algebra) , path graph , edge graceful labeling , graph power , discrete mathematics , line graph , computer science , geometry , programming language
A graph is composed of p vertices and q edges. A Pell labeling graph is the one with u V G being distinct. Label f u 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 f v 2 are distinct. In this paper we study Square of Path graph 2 P n and attach an edge to form a join to the square of path graph 2 P n and prove the join of square of path graph 2 P n is Pell labelling graph and further study on some interesting results connecting them.