TY - JOUR ID - 7973 TI - Super Pair Sum Labeling of Graphs JO - Journal of Algorithms and Computation JA - JAC LA - en SN - 2476-2776 AU - Vasuki, R. AU - Arockiaraj, S. AU - Sugirtha, P. AD - Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215,Tamil Nadu, INDIA AD - Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi-626124, Tamil Nadu AD - Department of Mathematics Dr. Sivanthi Aditanar College of Engineering Tiruchendur-628 215,Tamil Nadu, INDIA. Y1 - 2017 PY - 2017 VL - 49 IS - 2 SP - 13 EP - 22 DO - 10.22059/jac.2017.7973 N2 - 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. UR - https://jac.ut.ac.ir/article_7973.html L1 - https://jac.ut.ac.ir/article_7973_8d78e786bf0f7d9b317ea709b3d29cf1.pdf ER -