Volume 13 | Issue 2
Volume 13 | Issue 2
Volume 13 | Issue 2
Volume 13 | Issue 1
Volume 13 | Issue 1
A graph labelling trace their origin to one introduced by Rosa. A graph labelling is an assignment of integers to the vertices or the edges, or both, subject to certain conditions. If the domain is the set of vertices we speak about the vertex labelling. If the domain is the set of edges, then the labelling is called the edge labelling. If the labels are assigned to the vertices and also the edge of a graph such a labelling is called total. A pair sum labeling of a graph G(V,E) is defined as an injective map g from V(G) to {±1,±2…±p} is such that ge:E(G)→Z-{0} defined by ge(uv)=g(u)+g(v) is one-one and ge(E(G)) is either of the form {±k1 ±k2……±kq/2} or {±k1 ±k2…..kq-1/2}{kq+1/2} accordingly q is even or odd. The graph considered here will be finite, undirected and simple.