Pell Labeling of Joins of Square of Path Graph
S. Sriram1, R. Govindarajan2, K. Thirusangu3
1S. Sriram, Assistant Professor, Department of Mathematics, Patrician College of Arts and Science, Research Scholar, Part time University of Madras, Chennai (Tamil Nadu), India.
2R. Govindarajan, Associate Professor and Head Retd, Department of Mathematics, D.G. Vaishnav College, Arumbakkam, Chennai, University of Madras, Chennai (Tamil Nadu), India.
3K. Thirusangu, Associate Professor, Department of Mathematics, S.I.V.E.T College, Gowrivakkam , University of Madras, Chennai (Tamil Nadu), India.
Manuscript received on 18 December 2019 | Revised Manuscript received on 24 December 2019 | Manuscript Published on 31 December 2019 | PP: 409-413 | Volume-9 Issue-1S3 December 2019 | Retrieval Number: A10741291S319/19©BEIESP | DOI: 10.35940/ijeat.A1074.1291S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Square of Path Graph 2 P n,Pell labelling , Pell Labelling Graph, Joins of Square of Path Graph 2 P.
Scope of the Article: Cryptography and Applied Mathematics