Предфрактальнi переставнi комбiнаторнi конфiгурацiї

Isomorphisms between the set of permutations without repetition and the set of graphs are introduced in this article. The operation of replacing graph vertices by a seeding agent for the graph, which corresponding to the permutations, is defined. This operation is defined in terms of permutations and substitutions too.