Computing Certain Topological Indices of Silicate Triangle Fractal Network Modeled by the Sierpiński Triangle Network

The study of Sierpi & nacute;ski triangle network and extended Sierpi & nacute;ski graph is quite interesting in the field of fractal networks. In nature, fractal networks (FN) and silicate structure networks ( Sio 4 ) play vital roles and in architecture to analyze the dimension of the above-mentioned FN and Sio 4 networks it is necessary to identify the number of copies of the network. In this paper, we introduced a silicate triangle fractal network ( Si n ) which is a planar fractal and it is created using a related sequence of graphs named ( Si n ) n >= 0 , where n is the n th level of silicate triangle fractal network. We analyze the topological indices (TI) of the silicate triangle fractal network Si n graph and compare the calculated topological indices to the number of copies of silicate structure ( Sio 4 ) in each iteration of Si n for a sequence of a graph.