165. A CLASS OF SELF-SIMILAR NETWORKS

Vesna Andova; Pavel Dimovski

doi:10.51466/JEEIT201942-Jan0%p

Vesna Andova Faculty of Electrical Engineering and Information Technologies, "Ss. Cyril and Methodius" University in Skopje, Rugjer Bošković bb, P.O. box 574, 1001 Skopje, Republic of Macedonia
Pavel Dimovski Faculty of Electrical Engineering and Information Technologies, "Ss. Cyril and Methodius" University in Skopje, Rugjer Bošković bb, P.O. box 574, 1001 Skopje, Republic of Macedonia

DOI: https://doi.org/10.51466/JEEIT201942-Jan0%25p

Keywords: graph, networks, self-similarity

Abstract

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.