scholarly journals Forgotten Index of Generalized Operations on Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Muhammad Javaid ◽  
Saira Javed ◽  
Saima Q. Memon ◽  
Abdulaziz Mohammed Alanazi
Keyword(s):  
Structural Properties ◽  
Topological Indices ◽  
Theoretical Chemistry ◽  
Factor Graphs ◽  
Molecular Graphs ◽  
Strong Product ◽  
Forgotten Index ◽  
Counting Polynomial ◽  
Product Of Graphs

In theoretical chemistry, several distance-based, degree-based, and counting polynomial-related topological indices (TIs) are used to investigate the different chemical and structural properties of the molecular graphs. Furtula and Gutman redefined the F -index as the sum of cubes of degrees of the vertices of the molecular graphs to study the different properties of their structure-dependency. In this paper, we compute F -index of generalized sum graphs in terms of various TIs of their factor graphs, where generalized sum graphs are obtained by using four generalized subdivision-related operations and the strong product of graphs. We have analyzed our results through the numerical tables and the graphical presentations for the particular generalized sum graphs constructed with the help of path (alkane) graphs.

On degree-based topological descriptors of strong product graphs

2016 ◽  
Vol 94 (6) ◽  
pp. 559-565 ◽  
Author(s):  
Shehnaz Akhter ◽  
Muhammad Imran
Keyword(s):  
Physicochemical Properties ◽  
Strain Energy ◽  
Chemical Compounds ◽  
Topological Indices ◽  
Topological Descriptors ◽  
Zagreb Indices ◽  
Strong Product ◽  
Product Graphs ◽  
Product Of Graphs ◽  
Atom Bond

Topological descriptors are numerical parameters of a graph that characterize its topology and are usually graph invariant. In a QSAR/QSPR study, physicochemical properties and topological indices such as Randić, atom–bond connectivity, and geometric–arithmetic are used to predict the bioactivity of different chemical compounds. There are certain types of topological descriptors such as degree-based topological indices, distance-based topological indices, counting-related topological indices, etc. Among degree-based topological indices, the so-called atom–bond connectivity and geometric–arithmetic are of vital importance. These topological indices correlate certain physicochemical properties such as boiling point, stability, strain energy, etc., of chemical compounds. In this paper, analytical closed formulas for Zagreb indices, multiplicative Zagreb indices, harmonic index, and sum-connectivity index of the strong product of graphs are determined.

scholarly journals Computing FGZ Index of Sum Graphs under Strong Product

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Zhi-Ba Peng ◽  
Saira Javed ◽  
Muhammad Javaid ◽  
Jia-Bao Liu
Keyword(s):  
Structural Properties ◽  
Topological Index ◽  
Molecular Graph ◽  
Chemical Compounds ◽  
Zagreb Index ◽  
Strong Product ◽  
Product Of Graphs

Topological index (TI) is a function that assigns a numeric value to a (molecular) graph that predicts its various physical and structural properties. In this paper, we study the sum graphs (S-sum, R-sum, Q-sum and T-sum) using the subdivision related operations and strong product of graphs which create hexagonal chains isomorphic to many chemical compounds. Mainly, the exact values of first general Zagreb index (FGZI) for four sum graphs are obtained. At the end, FGZI of the two particular families of sum graphs are also computed as applications of the main results. Moreover, the dominating role of the FGZI among these sum graphs is also shown using the numerical values and their graphical presentations.

scholarly journals Computation of Topological Indices of NEPS of Graphs

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Muhammad Imran ◽  
Shehnaz Akhter ◽  
Muhammad Kamran Jamil
Keyword(s):  
Structural Properties ◽  
Topological Indices ◽  
Research Topic ◽  
Theoretical Chemistry ◽  
Networks And Graphs ◽  
Graph Product ◽  
Zeroth Order ◽  
General Graph ◽  
Zagreb Indices ◽  
Numerical Invariants

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.

Application of Corona Product of Graphs in Computing Topological Indices of Some Special Chemical Graphs

2017 ◽  
pp. 82-101
Author(s):  
Nilanjan De
Keyword(s):  
Topological Indices ◽  
Connectivity Index ◽  
Eccentric Connectivity Index ◽  
Molecular Graphs ◽  
Mathematical Chemistry ◽  
Graph Operations ◽  
Eccentricity Index ◽  
Chemical Graphs ◽  
Product Of Graphs ◽  
Corona Product

Graph operations play a very important role in mathematical chemistry, since some chemically interesting graphs can be obtained from some simpler graphs by different graph operations. In this chapter, some eccentricity based topological indices such as the total eccentricity index, eccentric connectivity index, modified eccentric connectivity index and connective eccentricity index and their respective polynomial versions of corona product of two graphs have been studied and also these indices of some important classes of chemically interesting molecular graphs are determined by specializing the components of corona product of graphs.

scholarly journals Computational Analysis of new Degree-based descriptors of oxide networks

2019 ◽  
Vol 17 (1) ◽  
pp. 177-182 ◽  
Author(s):  
Zafar Hussain ◽  
Mobeen Munir ◽  
Muhammad Bilal ◽  
Alam Ameer ◽  
Shazia Rafique ◽  
...  
Keyword(s):  
Computational Analysis ◽  
Graphical Analysis ◽  
Topological Indices ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Molecular Graphs ◽  
Pharmaceutical Industries ◽  
Forgotten Index

AbstractOxide networks have diverse applications in the polymer and pharmaceutical industries. Polynomials and degree-based topological indices have tendencies to correlate properties of molecular graphs. In this article, we formulate the closed forms of Zagreb and forgotten polynomials and topological indices such as Hyper-Zagreb index, first and second multiple Zagreb indices, forgotten index, Albert index, Bell index, IRM(G) of oxide networks. We also compute the F-index of complement of oxide networks, F-coindex of G and F-coindex of complement of oxide networks. We put graphical analysis of each index with respect to the parameter involved in each case.

scholarly journals Bounds of Degree-Based Molecular Descriptors for Generalized F -sum Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Jia Bao Liu ◽  
Sana Akram ◽  
Muhammad Javaid ◽  
Abdul Raheem ◽  
Roslan Hasni
Keyword(s):  
Structural Properties ◽  
Electron Energy ◽  
Boiling Point ◽  
Molecular Descriptors ◽  
Molecular Descriptor ◽  
Molecular Graph ◽  
Topological Indices ◽  
Real Numbers ◽  
Molecular Graphs

A molecular descriptor is a mathematical measure that associates a molecular graph with some real numbers and predicts the various biological, chemical, and structural properties of the underlying molecular graph. Wiener (1947) and Trinjastic and Gutman (1972) used molecular descriptors to find the boiling point of paraffin and total π -electron energy of the molecules, respectively. For molecular graphs, the general sum-connectivity and general Randić are well-studied fundamental topological indices (TIs) which are considered as degree-based molecular descriptors. In this paper, we obtain the bounds of the aforesaid TIs for the generalized F -sum graphs. The foresaid TIs are also obtained for some particular classes of the generalized F -sum graphs as the consequences of the obtained results. At the end, 3   D -graphical presentations are also included to illustrate the results for better understanding.

scholarly journals Toll number of the strong product of graphs

2019 ◽  
Vol 342 (3) ◽  
pp. 807-814
Author(s):  
Tanja Gologranc ◽  
Polona Repolusk
Keyword(s):  
Strong Product ◽  
Product Of Graphs

scholarly journals Topological Indices of Para-line Graphs of V-Phenylenic Nanostructures

2019 ◽  
Vol 17 (1) ◽  
pp. 260-266 ◽  
Author(s):  
Imran Nadeem ◽  
Hani Shaker ◽  
Muhammad Hussain ◽  
Asim Naseem
Keyword(s):  
Chemical Properties ◽  
Topological Indices ◽  
Structural Chemistry ◽  
Line Graphs ◽  
Physical And Chemical Properties ◽  
Graph Invariants ◽  
Molecular Graphs ◽  
Physical And Chemical ◽  
And Chemical Properties

Abstract The degree-based topological indices are numerical graph invariants which are used to correlate the physical and chemical properties of a molecule with its structure. Para-line graphs are used to represent the structures of molecules in another way and these representations are important in structural chemistry. In this article, we study certain well-known degree-based topological indices for the para-line graphs of V-Phenylenic 2D lattice, V-Phenylenic nanotube and nanotorus by using the symmetries of their molecular graphs.

ON MOSTAR INDEX OF GRAPHS

2021 ◽  
Vol 10 (4) ◽  
pp. 2115-2129
Author(s):  
P. Kandan ◽  
S. Subramanian
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Bipartite Graphs ◽  
Topological Indices ◽  
Great Success ◽  
Complete Graphs ◽  
Molecular Graphs ◽  
Graphs And Networks ◽  
Complete Bipartite Graphs ◽  
Simple Connected Graph

On the great success of bond-additive topological indices like Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a peripherality measure in molecular graphs and networks. For a connected graph G, the Mostar index is defined as $$M_{o}(G)=\displaystyle{\sum\limits_{e=gh\epsilon E(G)}}C(gh),$$ where $C(gh) \,=\,\left|n_{g}(e)-n_{h}(e)\right|$ be the contribution of edge $uv$ and $n_{g}(e)$ denotes the number of vertices of $G$ lying closer to vertex $g$ than to vertex $h$ ($n_{h}(e)$ define similarly). In this paper, we prove a general form of the results obtained by $Do\check{s}li\acute{c}$ et al.\cite{18} for compute the Mostar index to the Cartesian product of two simple connected graph. Using this result, we have derived the Cartesian product of paths, cycles, complete bipartite graphs, complete graphs and to some molecular graphs.

scholarly journals On generalized 3-connectivity of the strong product of graphs

2018 ◽  
Vol 12 (2) ◽  
pp. 297-317
Author(s):  
Encarnación Abajo ◽  
Rocío Casablanca ◽  
Ana Diánez ◽  
Pedro García-Vázquez
Keyword(s):  
Positive Integer ◽  
Connected Graph ◽  
Sharp Bound ◽  
Connected Graphs ◽  
Strong Product ◽  
Generalized Connectivity ◽  
Internally Disjoint Trees ◽  
Product Of Graphs

Let G be a connected graph with n vertices and let k be an integer such that 2 ? k ? n. The generalized connectivity kk(G) of G is the greatest positive integer l for which G contains at least l internally disjoint trees connecting S for any set S ? V (G) of k vertices. We focus on the generalized connectivity of the strong product G1 _ G2 of connected graphs G1 and G2 with at least three vertices and girth at least five, and we prove the sharp bound k3(G1 _ G2) ? k3(G1)_3(G2) + k3(G1) + k3(G2)-1.

Sign in / Sign up

Export Citation Format

Share Document