Schultz and Modified Schultz Polynomials of Coronene Polycyclic Aromatic Hydrocarbons

Abstract

Let G = (V;E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V(G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices u and v in V(G) of graph G is the number of edges in a shortest path connecting them, we denote by d (u,v). In graph theory, we have many invariant polynomials for a graph G. In this research, we computing the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a Hydrocarbon molecule, that we call "Coronene Polycyclic Aromatic Hydrocarbons".

Computing Sanskruti index of the Polycyclic Aromatic Hydrocarbons

“…A member of this family for k = 2 is shown in Figure 1 and a general representation is shown in Figure 2. In (Farahani, 2013a(Farahani, , 2013b(Farahani, , 2013c(Farahani, , 2014(Farahani, , 2015a(Farahani, , 2015b, 2015b, 2015bFarahani, Gao, & Rajesh Kanna, 2015a, 2015bFarahani, Jamil, & Rajesh Kanna, 2016;Kumar, 2016a, 2016b;Gao & Farahani, 2015;Jamil, Farahani, Ali Malik, & Imran, 2016;Li et al, 2017;Woodard & Snedeker, 2001;Yan, Li, Farahani, Imran, & Rajesh Kanna, 2016) some topological indices of molecular graphs Polycyclic Aromatic Hydrocarbons PAH k are computed. In this paper, we continue this work to compute the Sanskruti index of Polycyclic Aromatic Hydrocarbons PAH k .…”

ADMET and quantitative structure property relationship analysis of anti‐Covid drugs against omicron variant with some degree‐based topological indices

“…In literature there are many algebraic polynomials were introduced to calculate topological indices from one single polynomial instead of using the usual method by computing from its definition. Some important polynomials are Zagreb polynomial, 13 Hosoya polynomial, 14 Schultz polynomial, 15 Forgotten polynomial, 16 Matching polynomial, 17 Tutte polynomial, 18 M‐polynomial, 19 NM‐polynomial, 20 RNM‐polynomial 21 and so on. Recently many researches have been working using M‐polynomial to recover many degree‐based topological indices 22‐32 .…”

Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs

“…There are many studies on polynomials and indices with respect the Schultz and modified Schultz, [3][4][5][6] , and also, there are studies on applied of its, [7][8][9][10][11] .…”