  In the present paper, complete designs of graphs are considered. The notion
of (regular) sampling is introduced and analyzed in detail, showing that the
trivial necessary condition for its existence is actually sufficient. Some
examples are also provided.
