Polynomials and General Degree-Based Topological Indices of Generalized Sierpinski Networks
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/6657298 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1076-2787 1099-0526 |