Let G be a graph. An injective map is called a pair sum labeling if the induced edge function, defined by is one-one and is either of the form or according as q is even or odd. A graph with a pair sum labeling is call...Let G be a graph. An injective map is called a pair sum labeling if the induced edge function, defined by is one-one and is either of the form or according as q is even or odd. A graph with a pair sum labeling is called a pair sum graph. In this paper we investigate the pair sum labeling behavior of subdivision of some standard graphs.展开更多
Let G be a (p,q) graph. An injective map f:V(G)→﹛±1,±2,...±p﹜is called a pair sum labeling if the induced edge function, fe:E(G)→Z-﹛0﹜defined by fe(uv)=f(u)+f(v) is one-one and fe(E(G)) is either ...Let G be a (p,q) graph. An injective map f:V(G)→﹛±1,±2,...±p﹜is called a pair sum labeling if the induced edge function, fe:E(G)→Z-﹛0﹜defined by fe(uv)=f(u)+f(v) is one-one and fe(E(G)) is either of the form {±k1,±k2,...,±kq/2} or {±k1,±k2,...,±kq-1/2}∪{kq+1/2} according as q is even or odd. A graph with a pair sum labeling is called a pair sum graph. In this paper we investigate the pair sum labeling behavior of some trees which are derived from stars and bistars. Finally, we show that all trees of order nine are pair sum graphs.展开更多
文摘Let G be a graph. An injective map is called a pair sum labeling if the induced edge function, defined by is one-one and is either of the form or according as q is even or odd. A graph with a pair sum labeling is called a pair sum graph. In this paper we investigate the pair sum labeling behavior of subdivision of some standard graphs.
文摘Let G be a (p,q) graph. An injective map f:V(G)→﹛±1,±2,...±p﹜is called a pair sum labeling if the induced edge function, fe:E(G)→Z-﹛0﹜defined by fe(uv)=f(u)+f(v) is one-one and fe(E(G)) is either of the form {±k1,±k2,...,±kq/2} or {±k1,±k2,...,±kq-1/2}∪{kq+1/2} according as q is even or odd. A graph with a pair sum labeling is called a pair sum graph. In this paper we investigate the pair sum labeling behavior of some trees which are derived from stars and bistars. Finally, we show that all trees of order nine are pair sum graphs.
