On The Super Edge-graceful Trees of even orders (I)

摘要

A (p,q)-graph G is said to be edge graceful if the edges can be labeled by 1,2,..., q so that the vertex sums are distinct, mod p. It is shown that if a tree T is edge-graceful then its order must be odd. Lee conjectured that all trees of odd orders are edge-graceful. J. Mitchem and A. Simoson introduced the concept of super edge-graceful graphs which is a stronger concept than edge-graceful for some classes of graphs.