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 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.

An Analysis on the Markovian Model for Production Management and Establishment of New Pharmacies Using Hyper Graph

“…Preferably graphs might be determined by directed or undirected in which the relationships between samples are commensurate or not. e hyper graph has been explored innumerable data mining and information recuperation assignments, as it has the potential for assimilating an interrelationship between samples in higher order [16,17].…”

Topological Study of Zirconium TetrachlorideZrCl4under Molecular Descriptors

“…Let d v represent the degree of the vertex v, and it is de ned as the total count of edges connected to v. Let S v represent the degree sum of all its neighbors [16]. For basics of graphs and topological indices, see [2,[17][18][19][20][21][22][23].…”