通过 M 多项式看分形的拓扑特性

IF 0.9 Q2 MATHEMATICS

Arabian Journal of Mathematics Pub Date : 2024-07-01 DOI:10.1007/s40065-024-00466-z

Faiza Ishfaq, Muhammad Faisal Nadeem

{"title":"通过 M 多项式看分形的拓扑特性","authors":"Faiza Ishfaq, Muhammad Faisal Nadeem","doi":"10.1007/s40065-024-00466-z","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":54135,"journal":{"name":"Arabian Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s40065-024-00466-z.pdf","citationCount":"0","resultStr":"{\"title\":\"Topological properties of fractals via M-polynomial\",\"authors\":\"Faiza Ishfaq, Muhammad Faisal Nadeem\",\"doi\":\"10.1007/s40065-024-00466-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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.</p></div>\",\"PeriodicalId\":54135,\"journal\":{\"name\":\"Arabian Journal of Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s40065-024-00466-z.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Arabian Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s40065-024-00466-z\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Arabian Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s40065-024-00466-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

西尔宾斯基图经常与分形相关，分形适用于多个科学领域，如化学图论、计算机网络、生物学和物理科学。函数和多项式是计算机数学中预测网络特征的有力工具。拓扑描述符，通常是图约束，是描述计算机网络拓扑特征的绝对值。在这篇文章中，首先，我们计算了 Sierpiński-type 分形的 M 多项式。在对这些 M-polynomials 进行代数运算后，我们推导出一些与度相关的拓扑不变式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

$Topological properties of fractals via M-polynomial$

查看原文本刊更多论文

Topological properties of fractals via M-polynomial

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Arabian Journal of Mathematics MATHEMATICS-

CiteScore

2.20

自引率

8.30%

发文量

审稿时长

13 weeks

期刊介绍： The Arabian Journal of Mathematics is a quarterly, peer-reviewed open access journal published under the SpringerOpen brand, covering all mainstream branches of pure and applied mathematics. Owned by King Fahd University of Petroleum and Minerals, AJM publishes carefully refereed research papers in all main-stream branches of pure and applied mathematics. Survey papers may be submitted for publication by invitation only.To be published in AJM, a paper should be a significant contribution to the mathematics literature, well-written, and of interest to a wide audience. All manuscripts will undergo a strict refereeing process; acceptance for publication is based on two positive reviews from experts in the field.Submission of a manuscript acknowledges that the manuscript is original and is not, in whole or in part, published or submitted for publication elsewhere. A copyright agreement is required before the publication of the paper.Manuscripts must be written in English. It is the author''s responsibility to make sure her/his manuscript is written in clear, unambiguous and grammatically correct language.