Abstract
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection
such that, when each vertex is assigned the sum of all edges incident to it mod
, where
, the resulting vertex labels are distinct. In this paper we proved that double fan graphs, quadrilateral friendship graphs, and butterfly graphs are edge even graceful graphs.