Computation of Topological Indices of NEPS of Graphs

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

Full description

Saved in:
Bibliographic Details
Main Authors: Muhammad Imran, Shehnaz Akhter, Muhammad Kamran Jamil
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2021/9911226
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832561465581633536
author Muhammad Imran
Shehnaz Akhter
Muhammad Kamran Jamil
author_facet Muhammad Imran
Shehnaz Akhter
Muhammad Kamran Jamil
author_sort Muhammad Imran
collection DOAJ
description 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.
format Article
id doaj-art-eb1e8558d2e5445a89051c193aa7fe05
institution Kabale University
issn 1076-2787
1099-0526
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series Complexity
spelling doaj-art-eb1e8558d2e5445a89051c193aa7fe052025-02-03T01:25:01ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/99112269911226Computation of Topological Indices of NEPS of GraphsMuhammad Imran0Shehnaz Akhter1Muhammad Kamran Jamil2Department of Mathematical Sciences, College of Sciences, United Arab Emirates University, Al Ain, UAESchool of Natural Sciences, National University of Sciences and Technology, Islamabad, PakistanDepartment of Mathematics, Riphah Institute of Computing and Applied Sciences, Riphah International University, Lahore, PakistanThe 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.http://dx.doi.org/10.1155/2021/9911226
spellingShingle Muhammad Imran
Shehnaz Akhter
Muhammad Kamran Jamil
Computation of Topological Indices of NEPS of Graphs
Complexity
title Computation of Topological Indices of NEPS of Graphs
title_full Computation of Topological Indices of NEPS of Graphs
title_fullStr Computation of Topological Indices of NEPS of Graphs
title_full_unstemmed Computation of Topological Indices of NEPS of Graphs
title_short Computation of Topological Indices of NEPS of Graphs
title_sort computation of topological indices of neps of graphs
url http://dx.doi.org/10.1155/2021/9911226
work_keys_str_mv AT muhammadimran computationoftopologicalindicesofnepsofgraphs
AT shehnazakhter computationoftopologicalindicesofnepsofgraphs
AT muhammadkamranjamil computationoftopologicalindicesofnepsofgraphs