Topological properties of fractals via M-polynomial

Abstract

AbstractSierpiński graphs are frequently related to fractals, and fractals apply in several fields of science, i.e., in chemical graph theory, computer networking, biology, and physical sciences. Functions and polynomials are powerful tools in computer mathematics for predicting the features of networks. Topological descriptors, frequently graph constraints, are absolute values that characterize the topology of a computer network. In this essay, Firstly, we compute the M-polynomials for Sierpiński-type fractals. We derive some degree-dependent topological invariants after applying algebraic operations on these M-polynomials.