 Covering graph

A covering graph is a graph map that induces a bijection on the incident oriented edges at every vertex. Connected based covers of a graph correspond to subgroups of its fundamental group.