PELL LABELING FOR SOME GRAPHS

Cite this:
SHIAMA, J. (2013). PELL LABELING FOR SOME GRAPHS. Asian Journal of Current Engineering and Maths, 2(4). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/187
© 2022 Interactive Protocols
Article Views
265
Altmetric
1
Citations
-

Abstract

I defined a new labeling and a new graph called Pell labeling and Pell graph. Let
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.

 Special Issue

Article Metrics Graph

Content

Section

Source