Let be a -graph in which the edges are labeled . The vertex sum for a vertex is the sum of the labels of the incident edges at . If can be labeled so that the vertex sums are distinct, mod , then is said to be edge-graceful. If the edges of can be labeled so that the vertex sums are constant, mod , then is said to be edge-magic. It is conjectured by Lee [9] that any connected simple -graph with 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.