On Edge-Graceful and Edge-Magic Maximal Outerplanar Graphs

Sin-Min Lee1, Medei Kitagaki1, Joseph Young1, William Kocay2
1Department of Computer Science San Jose State University San Jose, California 95192 U.S.A.
2Department of Computer Science University of Manitcba Winnipeg, Canada R3T 2N2

Abstract

Let \( G \) be a \( (p,q) \)-graph in which the edges are labeled \( 1, 2, 3, \ldots, q \). The vertex sum for a vertex \( v \) is the sum of the labels of the incident edges at \( v \). If \( G \) can be labeled so that the vertex sums are distinct, mod \( p \), then \( G \) is said to be edge-graceful. If the edges of \( G \) can be labeled \( 1, 2, 3, \ldots, q \) so that the vertex sums are constant, mod \( p \), then \( G \) is said to be edge-magic. It is conjectured by Lee [9] that any connected simple \( (p,q) \)-graph with \( q(q+1) \equiv p(p-1)/2 \pmod{p} \) vertices is edge-graceful. We show that the conjecture is true for maximal outerplanar graphs. We also completely determine the edge-magic maximal outerplanar graphs.