Contents

-

On Q(a)P(b)-Super Edge-graceful Graphs

Dharam Chopra1, Sin-Min Lee2
1Department of Mathematics and Statistics Wichita State University Wichita, Kansas 67260
2Department of Computer Science San Jose State University San Jose, California 95192

Abstract

Let a,b be two positive integers. For the graph G with vertex set V(G) and edge set E(G) with p=|V(G)| and q=|E(G)|, we define two sets Q(a) and P(b) as follows:

Q(a)={{±a,±(a+1),,±(a+q22)}if q is even{0}{±a,±(a+1),,±(a+(q3)/2)}if q is odd

P(b)={{±b,±(b+1),,±(b+(p2)/2)}if p is even{0}{±b,±(b+1),,±(b+(p32)/2)}if p is odd

For the graph G with p=|V(G)| and q=|E(G)|, G is said to be Q(a)P(b)-super edge-graceful (in short Q(a)P(b)-SEG), if there exists a function pair (f,f+) which assigns integer labels to the vertices and edges; that is, f+:V(G)P(b), and f:E(G)Q(a) such that f+ is onto P(b) and f is onto Q(a), and

f+(u)={f(u,v):(u,v)E(G)}.

We investigate Q(a)P(b) super edge-graceful graphs.