Abstract
Abstract Sierpiński graphs are family of fractal nature graphs having applications in mathematics of Tower of Hanoi, topology, computer science, and many more diverse areas of science and technology. This family of graphs can be generated by taking certain number of copies of the same basic graph. A topological index is the number which shows some basic properties of the chemical structures. This article deals with degree based topological indices of uniform subdivision of the generalized Sierpiński graphs S(n,G) and Sierpiński gasket Sn . The closed formulae for the computation of different kinds of Zagreb indices, multiple Zagreb indices, reduced Zagreb indices, augmented Zagreb indices, Narumi-Katayama index, forgotten index, and Zagreb polynomials have been presented for the family of graphs.
Highlights
Applications of molecular structure descriptors are a standard procedure in the study of structure–property relations nowadays, especially in the field of QSAR/QSPR study
The finite number of iterations in Sierpiński graphs gives Sierpiński gasket graphs and it is denoted by Sn
We study three types of Sierpiński graphs and we will calculate the degree based topological indices for these types
Summary
Applications of molecular structure descriptors are a standard procedure in the study of structure–property relations nowadays, especially in the field of QSAR/QSPR study. We study three types of Sierpiński graphs and we will calculate the degree based topological indices for these types. The first and second Zagreb indices which are known as the graph invariants are the first vertex degree based structures descriptors defined by Gutman and Trinajstić (1972), and elaborated in Gutman et al (1975) as
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
