Topological Properties of Fractals Via M-polynomial
ARABIAN JOURNAL OF MATHEMATICS(2024)
摘要
Sierpiń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.
更多查看译文
关键词
05C09,05C92
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要