Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs

Muhammad Imran and Muhammad Kamran Jamil

Chaos, Solitons & Fractals, 2020, vol. 132, issue C

Abstract: Sierpiński graphs are broadly investigated graphs of fractal nature with applications in topology, computer science and mathematics of Tower of Hanoi. The generalized Sierpiński graphs are determined by reproduction of precisely the same graph, producing self-similar graph. Graph invariant referred to as topological index is used to predict physico-chemical properties, thermodynamic properties and biological activity of chemical. In QSAR/QSPR study, these graph invariants act a key role. In this article, we studied the first, second Zagreb and forgotten indices for generalized Sierpiński graph with arbitrary base graph G. Moreover, we obtained some sharp bounds with different parameters as order, size, maximum and minimum degree of G for these topological indices of generalized Sierpiński graph.

Keywords: Generalized Sierpiński network; Zagreb indices; Forgotten index; Extremal graphs (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077920300072
Full text for ScienceDirect subscribers only

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:eee:chsofr:v:132:y:2020:i:c:s0960077920300072

DOI: 10.1016/j.chaos.2020.109608

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().