Computation of Topological Indices of NEPS of Graphs. (14th June 2021)

• Record Type: Journal Article
• Authors: Imran, Muhammad; Akhter, Shehnaz; Jamil, Muhammad Kamran
• Other Names: Javaid Muhammad Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-06-14
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/9911226
• Languages: English
• ISSNs: 1076-2787

Abstract

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.