Tatarinov E. Graphs reconstruction by agent which move by them

In this work are proposed a new method for reconstructing a graph. This method based on building an implicit numeration on graph vertexes by the marks the graph with colors and / or pebbles. On its basis, are proposed a new basic algorithm. Found five modifications M1 - M5 basic algorithm. Introduced and studied operations on graphs, it is shown that the complexity of the resulting graph reconstruction is expressed by the sum of the complexities component reconstruction, shows that the number of stones required for the recovery of the resulting graph is expressed by the sum of the number of stones used to reconstruct components.