University of Tehran
Journal of Algorithms and Computation
2476-2776
49
2
2017
12
01
Super Pair Sum Labeling of Graphs
13
22
7973
10.22059/jac.2017.7973
EN
R.
Vasuki
Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215,Tamil Nadu, INDIA
S.
Arockiaraj
Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi-626124, Tamil Nadu
P.
Sugirtha
Department of Mathematics
Dr. Sivanthi Aditanar College of Engineering Tiruchendur-628 215,Tamil Nadu, INDIA.
Journal Article
2017
02
08
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {it super pair sum graph}. Here we study about the super pair sum labeling of some standard graphs.
https://jac.ut.ac.ir/article_7973_8d78e786bf0f7d9b317ea709b3d29cf1.pdf