%0 Journal Article
%T Super Pair Sum Labeling of Graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Vasuki, R.
%A Arockiaraj, S.
%A Sugirtha, P.
%D 2017
%\ 12/01/2017
%V 49
%N 2
%P 13-22
%! Super Pair Sum Labeling of Graphs
%R 10.22059/jac.2017.7973
%X 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.
%U https://jac.ut.ac.ir/article_7973_8d78e786bf0f7d9b317ea709b3d29cf1.pdf