Polynomials and General Degree-Based Topological Indices of Generalized Sierpinski Networks

Chengmei Fan, M. Mobeen Munir, Zafar Hussain, Muhammad Athar, Jia-Bao Liu and M. Irfan Uddin

Complexity, 2021, vol. 2021, 1-10

Abstract: Sierpinski networks are networks of fractal nature having several applications in computer science, music, chemistry, and mathematics. These networks are commonly used in chaos, fractals, recursive sequences, and complex systems. In this article, we compute various connectivity polynomials such as M-polynomial, Zagreb polynomials, and forgotten polynomial of generalized Sierpinski networks Skn and recover some well-known degree-based topological indices from these. We also compute the most general Zagreb index known as α,β-Zagreb index and several other general indices of similar nature for this network. Our results are the natural generalizations of already available results for particular classes of such type of networks.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/6657298.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/6657298.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6657298

DOI: 10.1155/2021/6657298

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem (mohamed.abdelhakeem@hindawi.com).