Correspondence between a set of loops on a graph and a set consisting of perfect matchings in complete multipartite graphs assigned to vertices is considered. The latter is introduced to investigate some enumerative problem concerning to loops on a graph.