165. A CLASS OF SELF-SIMILAR NETWORKS
Large graphs, also known as networks, are often used to represent different natural or human made structures. In many of these networks the phenomenon of self-similarity was detected. Here we present a deterministic method for construction of a class of self-similar networks. The elements of this class are obtained by a vertex-transitive graphs, and an iterative construction procedure implemented on these graphs. This procedure provides the property of self-similarity in the obtained network.