The purpose of this paper is to present some properties of a new type of graph – called a
G-graph (Bretto and Laget, 2004; Bretto and Gillibert, 2004) – constructed from a group and to
present an algorithm to construct it. A graph that can be used as a powerful tool, surmounting
CAYLEY graphs’ limitations.