Some results on super pair sum graphs

Abstract

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 when p + q is odd and from 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 super pair sum graph. In this paper, we prove that the graphs Hn ⊙ mK1, (P2n; Sm), S’(P2n), < Bm,n : Pk > for m ≥ 1, n ≥ 1, k ≡ 2(mod 4), < B(m): Pk > for m ≥ 1, k ≡ 0, 2(mod 4) and 2Bm,n (m ≥ 1, n ≥ 1) are super pair sum graphs.