Computation of Topological Indices of NEPS of Graphs

Muhammad Imran, Shehnaz Akhter, Muhammad Kamran Jamil and Muhammad Javaid

Complexity, 2021, vol. 2021, 1-6

Abstract: The inspection of the networks and graphs through structural properties is a broad research topic with developing significance. One of the methods in analyzing structural properties is obtaining quantitative measures that encode data of the whole network by a real quantity. A large quantity of graph-associated numerical invariants has been used to examine the whole structure of networks. In this analysis, degree-related topological indices have a significant place in nanotechnology and theoretical chemistry. Thereby, the computation of indices is one of the successful branches of research. The noncomplete extended p-sum NEPS of graphs is a famous general graph product. In this paper, we investigated the exact formulas of general zeroth-order Randić, Randić, and the first multiplicative Zagreb indices for NEPS of graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/9911226.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/9911226.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:9911226

DOI: 10.1155/2021/9911226

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().