PELL LABELING FOR SOME GRAPHS
##plugins.themes.bootstrap3.article.main##
##plugins.themes.bootstrap3.article.sidebar##
Abstract
G be a (p, q) graph. If there exists a mapping f: V(G) →{ 0,1, …., p-1} such that
the induced function f* : E(G) → N given by f*(uv) = f(u) +2 f(v) for every uv
E(G) are all distinct where u,v ≥ 0, then the function f is called a Pell labeling. A
graph which admits Pell labeling is called Pell graph. In this paper the Pell
labeling for some graphs like paths, cycles, stars, double stars, coconut tree,
bistar and Bm,n,k are investigated.
How to Cite
##plugins.themes.bootstrap3.article.details##
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
Â
All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€