Computation of Topological Indices of NEPS of Graphs

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 $\left(\text{NEPS}\right)$ 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 $\text{NEPS}$ of graphs.