Next Article in Journal
Faber Polynomial Coefficient Estimates for Janowski Type bi-Close-to-Convex and bi-Quasi-Convex Functions
Next Article in Special Issue
Study on Structural Properties of Brain Networks Based on Independent Set Indices
Previous Article in Journal
A Promising Glass Type in Electronic and Laser Applications: Elastic Moduli, Mechanical, and Photon Transmission Properties of WO3 Reinforced Ternary-Tellurite Glasses
Previous Article in Special Issue
Enumerating Subtrees of Flower and Sunflower Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Valency-Based Indices for Some Succinct Drugs by Using M-Polynomial

by
Muhammad Usman Ghani
1,
Francis Joseph H. Campena
2,*,
K. Pattabiraman
3,*,
Rashad Ismail
4,5,*,
Hanen Karamti
6 and
Mohamad Nazri Husin
7,*
1
Institute of Mathematics, Khawaja Fareed University of Engineering & Information Technology, Abu Dhabi Road, Rahim Yar Khan 64200, Pakistan
2
Department of Mathematics and Statistics, College of Science, De La Salle University, 2401 Taft Avenue, Malate, Manila 1004, Philippines
3
Department of Mathematics Government Arts College (Autonomous), Kumbakonam 612 002, India
4
Department of Mathematics, Faculty of Science and Arts, King Khalid University, Muhayl 61913, Saudi Arabia
5
Department of Mathematics and Computer, Faculty of Science, Ibb University, Ibb 70270, Yemen
6
Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University, Riyadh 11671, Saudi Arabia
7
Special Interest Group on Modelling & Data Analytics (SIGMDA), Faculty of Ocean Engineering Technology & Informatics, Universiti Malaysia Terengganu, Kuala Terengganu 21030, Malaysia
*
Authors to whom correspondence should be addressed.
Symmetry 2023, 15(3), 603; https://doi.org/10.3390/sym15030603
Submission received: 4 January 2023 / Revised: 5 February 2023 / Accepted: 20 February 2023 / Published: 27 February 2023
(This article belongs to the Special Issue Topological Indices and Symmetry in Complex Networks)

Abstract

:
A topological index, which is a number, is connected to a graph. It is often used in chemometrics, biomedicine, and bioinformatics to anticipate various physicochemical properties and biological activities of compounds. The purpose of this article is to encourage original research focused on topological graph indices for the drugs azacitidine, decitabine, and guadecitabine as well as an investigation of the genesis of symmetry in actual networks. Symmetry is a universal phenomenon that applies nature’s conservation rules to complicated systems. Although symmetry is a ubiquitous structural characteristic of complex networks, it has only been seldom examined in real-world networks. The M ¯ -polynomial, one of these polynomials, is used to create a number of degree-based topological coindices. Patients with higher-risk myelodysplastic syndromes, chronic myelomonocytic leukemia, and acute myeloid leukemia who are not candidates for intense regimens, such as induction chemotherapy, are treated with these hypomethylating drugs. Examples of these drugs are decitabine (5-aza-20-deoxycytidine), guadecitabine, and azacitidine. The M ¯ -polynomial is used in this study to construct a variety of coindices for the three brief medicines that are suggested. New cancer therapies could be developed using indice knowledge, specifically the first Zagreb index, second Zagreb index, F-index, reformulated Zagreb index, modified Zagreb, symmetric division index, inverse sum index, harmonic index, and augmented Zagreb index for the drugs azacitidine, decitabine, and guadecitabine.

1. Introduction

Investigating and even forecasting certain features of chemical compounds is performed using the branch of graph theory known as “chemical graph theory” [1,2,3]. The amount of components a molecule has and their connections may be used to predict a molecule’s boiling point, according to molecular graph theory. Understanding this relationship is very helpful when developing chemical processes, synthetic materials, or chemical assembly lines. Chemists make use of a number of physical characteristics to comprehend the structure of molecules. Topological indices (TIs) [4] are used to forecast the physio-chemical properties and biological activities of bioactive substances, but their potential extends far beyond. For example, they can anticipate how dangerous a chemical will be. Because medication performance can now be anticipated based on electrical structure, the TI provides an alternative to empirical testing [5,6,7,8,9].
Transportation, communication network design, manufacturing and inventory planning, facility location and allocation, and VLSI (very large-scale integration) design are just a few of the areas where symmetry is used. Numerous TIs have been created since 1947, and these indices are divided into groups based on the structural properties of the graph [10,11,12], such as the degree of the vertices, the distance between neighboring vertices, the graph’s eigenvalues, and others [13,14,15]. It is not always possible to compute some TIs directly. Researchers employ polynomials to address this issue. The degree-dependent M-polynomial for the TIs is one of them. The M-polynomial is a polynomial that is the sum of all the various degree-based TI subtypes.
Graph polynomials are graph functions that are independent of graph isomorphism, [16]. They are generally polynomials in one or two variables with integer coefficients. Since certain subgraphs are virtually always counted, graph polynomials may be seen as regular generating functions for the sequences of coefficients. The Hosoya polynomial [17,18,19,20] is a significant polynomial in the area of distance-based TIs. In [21,22,23,24,25], more graph polynomials were investigated. Deutsch and Klavzar [26] also proposed the M-polynomial, a degree-based polynomial that may be applied to build a variety of indices. Its high degree of flexibility led to its application in several research works to generate TIs. To calculate additional varieties of graph coindices, a polynomial that takes into account nonadjacent pairs of vertices is required because the M-polynomial only takes into account contributions from pairs of adjacent vertices. The M-polynomial and this polynomial both have comparable modes of operation. The development of polynomials based on non-adjacent pairings of chemical compound vertices was primarily motivated by this. Recently in 2022, a new M-polynomial, namely M ¯ -polynomial, was proposed by Kirmani et al. [27,28] to generalized the widely used M-polynomial. They focused on the degree-based topological coindices (DBTCI). Following it, other authors produced many more works in this manner.
Applications of Graph Theory and Topological Indices
Any graph that mimics a particular molecular structure can be given a topological graph index, also known as a molecular descriptor [29]. From this index, it is possible to analyze numerical numbers and further look into some of a molecule’s physical characteristics. As a result, it is a useful technique to eliminate costly and time-consuming laboratory studies. In mathematical chemistry, molecular descriptors are crucial, particularly in studies of quantitative structure–property relationships (QSPR) and quantitative structure–activity relationships (QSAR) [30]. For example, Ghani at all. in [31] started work on entropy by using topological indices. A topological descriptor is an illustration of a molecular descriptor. There are several topological indices available today, some of which are used in chemistry [32,33]. The structural characteristics of the graphs utilized for their computation can be used to categorize them. The Hosoya index, for instance, is determined by counting non-incident edges in a graph. In addition, the degrees of vertices are used to generate the Randi connectivity index, the Zagreb group indices, the Estrada index, and other indices.

1.1. Azacitidine Drug

A medication called azacitidine [34] inhibits DNA methyltransferase. It is an analog of cytidine’s pyridine nucleoside. Its chemical name is 4-amino1-D-ribofuranosyl-s-triazin-2(1H)-one. Azacitidine has the empirical formula C 8 H 12 N 4 O 5 (see Figure 1). Myelodysplastic syndrome, acute myeloid leukemia, and chronic myelomonocytic leukemia are all treated with it.

1.2. Decitabine Drug

Myelodysplastic syndromes can be treated with the chemotherapeutic medication decitabine [34]. It achieves this by modifying gene expression and increasing the likelihood that DNA will not be protected. For people with significant MDS, refractory anemia, refractory anemia with ringed sideroblasts, refractory anemia with excess blasts and refractory anemia with excess blasts in transform, decidetabine is prescribed. Patients who have an International Prognostic Scoring System risk score of intermediate-1, intermediate-2, or high risk may also benefit from this medication. Decitabine’s (see Figure 2) empirical formula is C 8 H 12 N 4 O 4 .

1.3. Guadecitabine Drug

The next-generation hypomethylating drug is guadecitabine [35]. More potent hypomethylating drugs are required for the treatment of MDS. The active metabolite of guadecitabine, decitabine, has a longer in vivo exposure period than decitabine given intravenously. Guadecitabine (see Figure 3) is used to treat myelodysplastic syndromes with intermediate or high risk because it is a more effective hypomethylating drug as a consequence. The bone marrow does not mature or become healthy in patients with myelodysplastic syndromes. It is also known as a collection of cancers.
The Figure 4 represent the chemical structure of azacitidine drug.
Figure 5 represents the chemical structure of decitabine.
Figure 6 represents the chemical structure of guadecitabine.

2. Preliminaries

Let us use the following notation for the rest of the paper. Let G = ( V , E ) be a graph, where V = V ( G ) and E = E ( G ) represent the vertex set and edge set, respectively. A molecular graph is a straightforward finite graph, where the edges represent chemical bonds and the vertices represent atoms. The degree of a vertex x is the number of edges incident to x , denoted by d x . The notation V i denotes the number of vertices in the set V i . The notation | E ( G ) | denotes the number of edges in graph G or the size of a graph. Define
ρ i = V i , where V i = { x V ( G ) | d x = i } .
ω i j = E i j , where E i j = { x y V ( G ) | d x = i , d y = j } .
ω ¯ i j = E ¯ i j , where E ¯ i j = { x y V ( G ¯ ) | d x = i , d y = j } .
We concentrate the concept of the M-polynomial for a non-adjacent pair of vertices and define M ¯ -polynomial as follows:
M ¯ ( G , x , y ) = i j ω ¯ i j ( G ) x i y j ,
where ω ¯ i j , is the number of edges x y E ( G ) such that { d ( x ) , d ( y ) } = { i , j } .
On the edge set E ( G ) of a graph G , the DBTCI can be stated as
D B C I ( G ) = x y E ( G ) z ( x , y ) .

Formulation of Certain Coindices from M ¯ -Polynomial

In Table 1, a few DBTCI are listed along with their connections to the M ¯ -polynomial of a graph G.
ϕ x ( z ( x , y ) ) = x ( z ( x , y ) ) x , ϕ y ( z ( x , y ) ) = y ( z ( x , y ) ) y , S x ( z ( x , y ) ) = 0 x z ( t , y ) t d t , S y ( z ( x , y ) ) = 0 y z ( x , t ) t d t and J ( z ( x , y ) ) = z ( x , x ) .
Table 1. Derivation of DBTCI using M ¯ -polynomial.
Table 1. Derivation of DBTCI using M ¯ -polynomial.
DBCI z ( d u , d v ) Derivation from M ¯ ( G , x , y )
First Zagreb coindex ω ¯ 1 d u + d v ϕ x + ϕ y ( M ¯ ( G ) ) at x = y = 1
Second Zagreb coindex ω ¯ 2 d u d v ϕ x ϕ y ( M ¯ ( G ) ) at x = y = 1
F- coindex F ¯ d u 2 + d v 2 ϕ x 2 + ϕ y 2 ( M ¯ ( G ) ) at x = y = 1
Reformulated Zagreb coindex R Z ¯ d u + d v d u d v ϕ x ϕ y ( ϕ x + ϕ y ) ( M ¯ ( G ) ) at x = y = 1
Modified Zagreb coindex M ¯ * 1 d u d v ( S x S y ) ( M ¯ ( G ) ) at x = y = 1
Symmetric deg devision coindex S D D ¯ d u 2 + d v 2 d u d v ( ϕ x S y + S x ϕ y ) ) ( M ¯ ( G ) ) at x = y = 1
Inverse sum indeg coindex I S I ¯ d u d v d u + d v ( S x J ϕ x ϕ y ) ( M ¯ ( G ) ) at x = y = 1
Harmonic coindex H ¯ 2 d u + d v ( 2 S x J ) ( M ¯ ( G ) ) at x = 1
Augmented Zagreb coindex A Z ¯ d u d v d u + d v 2 3 ( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( M ¯ ( G ) ) at x = 1
The proof of the following observation is due to Berhe [36].
We have the following for a connected graph G with n vertices:
(i)
If i = j then ω ¯ i j = E ¯ i j = ρ i ( ρ i 1 ) 2 ω i i .
(ii)
If i < j then ω ¯ i j = E ¯ i j = ρ i ρ j ω i j .
Theorem 1.
Let A be the molecular graph of Azacitidine. The M ¯ polynomial for A is M ¯ ( A ; x , y ) = 9 x y 2 + 31 x y 3 + 9 x 2 y 2 + 28 x 2 y 3 + 16 x 3 y 3 .
Proof. 
For the molecular graph of azacitidine (see Figure 1, Figure 4 and Figure 7), we can easily calculate the edge partition given in the main theorems by using the hand shake lemma [37]. According to the “handshaking theorem,” a graph’s vertex total is equal to twice as many edges as it has edges, as in Equation (1). Since a vertex’s degree is determined by how many edges intersect it, the sum of degrees determines how frequently an edge intersects a vertex overall:
i = 1 n d x = 2 × | E ( G ) |
There are 17 vertices and 18 edges from the construction of azacitidinen (Figure 7), we have five categories of edge set of A based on the degree of vertices. ω 12 = | E 12 | = 1 , ω 13 = | E 13 | = 4 , ω 22 = | E 22 | = 1 , ω 23 = | E 23 | = 7 and ω 33 = | E 33 | = 5 . In addition, V ( A ) may be divided into three groups according on the number of vertices, that is, ρ 1 = | V 1 | = 5 , ρ 2 = | V 2 | = 5 and ρ 3 = | V 3 | = 7 . Using Observation 1, we obtain
ω ¯ 12 = ρ 1 ρ 2 ω 12 = 5 ( 5 ) 1 = 9
ω ¯ 13 = ρ 1 ρ 3 ω 13 = 5 ( 7 ) 4 = 31
ω ¯ 22 = ρ 2 ( ρ 2 1 ) 2 ω 22 = 5 ( 4 ) 2 1 = 9
ω ¯ 23 = ρ 2 ρ 3 ω 23 = 5 ( 7 ) 7 = 28
ω ¯ 33 = ρ 3 ( ρ 3 1 ) 2 ω 33 = 7 ( 6 ) 2 5 = 21 5 = 16 .
Hence, by the definition of M ¯ polynomial, we have
M ¯ ( A ; x , y ) = i j ω ¯ i j ( A ) x i y j = 1 2 ω ¯ 12 ( A ) x y 2 + 1 3 ω ¯ 13 ( A ) x y 3 + 2 2 ω ¯ 22 ( A ) x 2 y 2 + 2 3 ω ¯ 23 ( A ) x 2 y 3 + 3 3 ω ¯ 33 ( A ) x 3 y 3 = 9 x y 2 + 31 x y 3 + 9 x 2 y 2 + 28 x 2 y 3 + 16 x 3 y 3 .
Now we present some DBTCI of azacitidine using M ¯ -polynomial. □
Theorem 2.
Let A be the molecular graph of azacitidine. Then
( 1 ) ω ¯ 1 ( A ) = 423 ( 2 ) ω ¯ 2 ( A ) = 459 ( 3 ) F ¯ ( A ) = 1079 ( 4 ) R Z ¯ ( A ) = 2274 ( 5 ) ω ¯ 2 * ( A ) = 23.528 ( 6 ) S D D ¯ ( A ) = 236.5 ( 7 ) H ¯ ( A ) = 21.267 ( 8 ) I S I ¯ ( A ) = 95.85 (9) A Z ¯ ( A ) = 654.875 .
Proof. 
For computing the DBTCI, we consider M ¯ ( A ; x , y ) = 9 x y 2 + 31 x y 3 + 9 x 2 y 2 + 28 x 2 y 3 + 16 x 3 y 3 .
ϕ x ( z ( x , y ) ) = 9 x y 2 + 31 x y 3 + 18 x 2 y 2 + 56 x 2 y 3 + 48 x 3 y 3 .
ϕ y ( z ( x , y ) ) = 18 x y 2 + 63 x y 3 + 18 x 2 y 2 + 84 x 2 y 3 + 48 x 3 y 3 .
( ϕ x + ϕ y ) ( z ( x , y ) ) = 27 x y 2 + 124 x y 3 + 36 x 2 y 2 + 140 x 2 y 3 + 96 x 3 y 3 .
ϕ x ϕ y ( z ( x , y ) ) = 18 x y 2 + 93 x y 3 + 36 x 2 y 2 + 168 x 2 y 3 + 144 x 3 y 3 .
( ϕ x 2 + ϕ y 2 ) ( z ( x , y ) ) = 45 x y 2 + 310 x y 3 + 72 x 2 y 2 + 364 x 2 y 3 + 288 x 3 y 3 .
( ϕ x + ϕ y ) ϕ x ϕ y ( z ( x , y ) ) = 54 x y 2 + 372 x y 3 + 144 x 2 y 2 + 840 x 2 y 3 + 864 x 3 y 3 .
S x S y ( z ( x , y ) ) = 9 2 x y 2 + 31 3 x y 3 + 9 4 x 2 y 2 + 28 6 x 2 y 3 + 16 9 x 3 y 3 .
( S x ϕ y + S y ϕ x ) ( z ( x , y ) ) = 45 2 x y 2 + 310 3 x y 3 + 72 4 x 2 y 2 + 364 6 x 2 y 3 + 288 9 x 3 y 3 .
S x J ( z ( x , y ) ) = 9 3 x 3 + 40 4 x 4 + 28 5 x 5 + 16 6 x 6 .
S x J ϕ x ϕ y ( z ( x , y ) ) = 6 x 3 + 129 4 x 4 + 168 5 x 5 + 24 x 6 .
( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( z ( x , y ) ) = 72 x + 1413 8 x 2 + 224 x 3 + 729 4 x 4 .
Now, these data in Table 1 immediately yield the aforementioned results:
ω ¯ 1 ( A ) = ( ϕ x + ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 423 .
ω ¯ 2 ( A ) = ( ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 459 .
F ¯ ( A ) = ( ϕ x 2 + ϕ y 2 ) ( ( z ( x , y ) ) ) | x = y = 1 = 1079 .
R Z ¯ ( A ) = ( ( ϕ x + ϕ y ) ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 2274 .
ω ¯ 2 * ( A ) = ( S x S y ) ( ( z ( x , y ) ) ) | x = y = 1 = 23.528 .
S D D ¯ ( A ) = ( S x ϕ y + S y ϕ x ) ( ( z ( x , y ) ) ) | x = y = 1 = 236.5 .
H ¯ ( A ) = ( S x J ) ( ( z ( x , y ) ) ) | x = 1 = 21.267 .
I S I ¯ ( A ) = ( S x J ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = 1 = 95.85 .
A Z ¯ ( A ) = ( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( z ( x , y ) ) | x = 1 = 654.875 .
Theorem 3.
Let T be the molecular graph of decitabine. Then M ¯ ( T ; x , y ) = 23 x y 2 + 21 x y 3 + 14 x 2 y 2 + 21 x 2 y 3 + 12 x 3 y 3 .
Proof. 
Consider T to be the molecular graph of decitabine which contains 16 vertices and 17 edges. The following is the distribution of edges based on vertex degrees: ω 12 = | E 12 | = 1 , ω 13 = | E 13 | = 3 , ω 22 = | E 22 | = 1 , ω 23 = | E 23 | = 9 and ω 33 = | E 33 | = 3 . And the partition of vertices that depend on their degrees are given as ρ 1 = | V 1 | = 4 , ρ 2 = | V 2 | = 6 and ρ 3 = | V 3 | = 6 . By Observation 1, we obtain
ω ¯ 12 = ρ 1 ρ 2 ω 12 = 4 ( 6 ) 1 = 23
ω ¯ 13 = ρ 1 ρ 3 ω 13 = 4 ( 6 ) 3 = 21
ω ¯ 22 = ρ 2 ( ρ 2 1 ) 2 ω 22 = 6 ( 5 ) 2 1 = 14
ω ¯ 23 = ρ 2 ρ 3 ω 23 = 6 ( 6 ) 9 = 27
ω ¯ 33 = ρ 3 ( ρ 3 1 ) 2 ω 33 = 6 ( 5 ) 2 3 = 12 .
Hence, by the definition of the M ¯ -polynomial, we have
M ¯ ( T ; x , y ) = i j ω ¯ i j ( G ) x i y j = ω ¯ 12 x y 2 + ω ¯ 13 x y 3 + ω ¯ 22 x 2 y 2 + ω ¯ 23 x 2 y 3 + ω ¯ 33 x 3 y 3 = 23 x y 2 + 21 x y 3 + 14 x 2 y 2 + 27 x 2 y 3 + 12 x 3 y 3 .
Theorem 4.
For a decitabine graph, we have
( 1 ) ω ¯ 1 ( T ) = 386 ( 2 ) ω ¯ 2 ( T ) = 399 ( 3 ) F ¯ ( T ) = 926 ( 4 ) R Z ¯ ( T ) = 1892 ( 5 ) ω ¯ 2 * ( T ) = 26.833 ( 6 ) S D D ¯ ( T ) = 225 ( 7 ) H ¯ ( T ) = 22.617 ( 8 ) I S I ¯ ( T ) = 88.283 . (9) A Z ¯ ( T ) = 1455.5625 .
Proof. 
For computing the DBTCI of decitabine (Figure 8), we consider M ¯ ( T ; x , y ) = 23 x y 2 + 21 x y 3 + 14 x 2 y 2 + 21 x 2 y 3 + 12 x 3 y 3 .
ϕ x ( z ( x , y ) ) = 23 x y 2 + 21 x y 3 + 28 x 2 y 2 + 42 x 2 y 3 + 36 x 3 y 3 .
ϕ y ( z ( x , y ) ) = 46 x y 2 + 63 x y 3 + 28 x 2 y 2 + 63 x 2 y 3 + 36 x 3 y 3 .
( ϕ x + ϕ y ) ( z ( x , y ) ) = 69 x y 2 + 84 x y 3 + 56 x 2 y 2 + 105 x 2 y 3 + 72 x 3 y 3 .
ϕ x ϕ y ( z ( x , y ) ) = 46 x y 2 + 63 x y 3 + 56 x 2 y 2 + 126 x 2 y 3 + 108 x 3 y 3 .
( ϕ x 2 + ϕ y 2 ) ( z ( x , y ) ) = 115 x y 2 + 210 x y 3 + 112 x 2 y 2 + 273 x 2 y 3 + 216 x 3 y 3 .
( ϕ x + ϕ y ) ϕ x ϕ y ( z ( x , y ) ) = 138 x y 2 + 252 x y 3 + 224 x 2 y 2 + 630 x 2 y 3 + 648 x 3 y 3 .
S x S y ( z ( x , y ) ) = 23 2 x y 2 + 21 3 x y 3 + 14 4 x 2 y 2 + 21 6 x 2 y 3 + 12 9 x 3 y 3 .
( S x ϕ y + S y ϕ x ) ( z ( x , y ) ) = 115 2 x y 2 + 210 3 x y 3 + 112 4 x 2 y 2 + 273 6 x 2 y 3 + 216 9 x 3 y 3 .
S x J ( z ( x , y ) ) = 23 3 x 3 + 35 4 x 4 + 21 5 x 5 + 12 6 x 6 .
S x J ϕ x ϕ y ( z ( x , y ) ) = 46 3 x 3 + 119 4 x 4 + 126 5 x 5 + 108 x 6 .
( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( z ( x , y ) ) = 184 x + 1463 8 x 2 + 168 x 3 + 2187 16 x 4 .
Now, these data in Table 1 immediately yield the aforementioned results.
ω ¯ 1 ( T ) = ( ϕ x + ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 386 .
ω ¯ 2 ( T ) = ( ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 399 .
F ¯ ( T ) = ( ϕ x 2 + ϕ y 2 ) ( ( z ( x , y ) ) ) | x = y = 1 = 926 .
R Z ¯ ( T ) = ( ( ϕ x + ϕ y ) ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 1892 .
ω ¯ 2 * ( T ) = ( S x S y ) ( ( z ( x , y ) ) ) | x = y = 1 = 26.833 .
S D D ¯ ( T ) = ( S x ϕ y + S y ϕ x ) ( ( z ( x , y ) ) ) | x = y = 1 = 225 .
H ¯ ( T ) = ( S x J ) ( ( z ( x , y ) ) ) | x = 1 = 22.617 .
I S I ¯ ( T ) = ( S x J ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = 1 = 88.283 .
A Z ¯ ( T ) = ( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( z ( x , y ) ) | x = 1 = 1455.5625 .
Figure 8. The molecular graph of decitabine.
Figure 8. The molecular graph of decitabine.
Symmetry 15 00603 g008
Theorem 5.
Let G be the molecular graph of guadecitabine. Then, we have M ¯ ( G ; x , y ) = 111 x y 2 + 107 x y 3 + 6 x y 4 + 88 x 2 y 2 + 176 x 2 y 3 + 13 x 2 y 4 + 83 x 3 y 3 + 13 x 3 y 4 .
Proof. 
Consider that the graph G of guadecitabine (Figure 9) has 37 vertices and 41 edges. The partition of edges that depends on the vertex degrees is given as ω 12 = | E 12 | = 1 , ω 13 = | E 13 | = 5 , ω 14 = | E 14 | = 2 , ω 22 = | E 22 | = 3 , ω 23 = | E 23 | = 20 , ω 24 = | E 24 | = 1 , ω 33 = | E 33 | = 8 and ω 34 = | E 34 | = 1 . Similarly, the partition of vertices that depends on their degrees is given as ρ 1 = | V 1 | = 8 , ρ 2 = | V 2 | = 14 , ρ 3 = | V 3 | = 14 and ρ 4 = | v 4 | = 1 . By Observation 1, we obtain
ω ¯ 12 = ρ 1 ρ 2 ω 12 = 8 ( 14 ) 1 = 111
ω ¯ 13 = ρ 1 ρ 3 ω 13 = 8 ( 14 ) 5 = 107
ω ¯ 14 = ρ 1 ρ 4 ω 14 = 8 ( 1 ) 2 = 6
ω ¯ 22 = ρ 2 ( ρ 2 1 ) 2 ω 22 = 14 ( 13 ) 2 3 = 88
ω ¯ 23 = ρ 2 ρ 3 ω 23 = 14 ( 14 ) 20 = 176
ω ¯ 24 = ρ 2 ρ 4 ω 24 = 14 ( 1 ) 1 = 13
ω ¯ 33 = ρ 3 ( ρ 3 1 ) 2 ω 33 = 14 ( 13 ) 2 8 = 83
ω ¯ 34 = ρ 3 ρ 4 ω 34 = 14 ( 1 ) 1 = 13 .
By the definition of the M ¯ -polynomial, we obtain
M ¯ ( G ; x , y ) = ω ¯ 12 x y 2 + ω ¯ 13 x y 3 + ω ¯ 14 x y 4 + ω ¯ 22 x 2 y 2 + ω ¯ 23 x 2 y 3 + ω ¯ 24 x 2 y 4 + ω ¯ 33 x 3 y 3 + ω ¯ 34 x 3 y 4 = 111 x y 2 + 107 x y 3 + 6 x y 4 + 88 x 2 y 2 + 176 x 2 y 3 + 13 x 2 y 4 + 83 x 3 y 3 + 13 x 3 y 4 .
Figure 9. The molecular graph of guadecitabine.
Figure 9. The molecular graph of guadecitabine.
Symmetry 15 00603 g009
Theorem 6.
For a guadecitabine graph, we have
( 1 ) ω ¯ 1 ( G ) = 2690 ( 2 ) ω ¯ 2 ( G ) = 2982 ( 3 ) F ¯ ( G ) = 6798 ( 4 ) R Z ¯ ( G ) = 14956 ( 5 ) ω ¯ 2 * ( G ) = 155.93 ( 6 ) S D D ¯ ( G ) = 1442.583 ( 7 ) H ¯ ( G ) = 140.007 ( 8 ) I S I ¯ ( G ) = 622.369 (9) A Z ¯ ( G ) = 4604.481 .
Proof. 
For computing the DBTCI, we consider M ¯ ( G ; x , y ) = 111 x y 2 + 107 x y 3 + 6 x y 4 + 88 x 2 y 2 + 176 x 2 y 3 + 13 x 2 y 4 + 83 x 3 y 3 + 13 x 3 y 4 .
ϕ x ( z ( x , y ) ) = 111 x y 2 + 107 x y 3 + 6 x y 4 + 176 x 2 y 2 + 352 x 2 y 3 + 26 x 2 y 4 + 249 x 3 y 3 + 39 x 3 y 4 .
ϕ y ( z ( x , y ) ) = 222 x y 2 + 321 x y 3 + 24 x y 4 + 176 x 2 y 2 + 528 x 2 y 3 + 52 x 2 y 4 + 249 x 3 y 3 + 52 x 3 y 4 .
( ϕ x + ϕ y ) ( z ( x , y ) ) = 333 x y 2 + 428 x y 3 + 6 x y 4 + 30 x 2 y 2 + 352 x 2 y 3 + 880 x 2 y 4 + 78 x 3 y 3 + 498 x 3 y 4 .
ϕ x ϕ y ( z ( x , y ) ) = 222 x y 2 + 321 x y 3 + 24 x y 4 + 352 x 2 y 2 + 1056 x 2 y 3 + 104 x 2 y 4 + 747 x 3 y 3 + 156 x 3 y 4 .
( ϕ x 2 + ϕ y 2 ) ( z ( x , y ) ) = 555 x y 2 + 1070 x y 3 + 102 x y 4 + 704 x 2 y 2 + 2288 x 2 y 3 + 260 x 2 y 4 + 1494 x 3 y 3 + 325 x 3 y 4 .
( ϕ x + ϕ y ) ϕ x ϕ y ( z ( x , y ) ) = 666 x y 2 + 1284 x y 3 + 120 x y 4 + 1408 x 2 y 2 + 5280 x 2 y 3 + 624 x 2 y 4 + 4482 x 3 y 3 + 1092 x 3 y 4 .
S x S y ( z ( x , y ) ) = 111 2 x y 2 + 107 2 x y 3 + 6 4 x y 4 + 88 4 x 2 y 2 + 176 6 x 2 y 3 + 13 8 x 2 y 4 + 83 9 x 3 y 3 + 13 12 x 3 y 4 .
( S x ϕ y + S y ϕ x ) ( z ( x , y ) ) = 555 2 x y 2 + 1070 3 x y 3 + 102 4 x y 4 + 704 4 x 2 y 2 + 2288 6 x 2 y 3 + 260 8 x 2 y 4 + 1494 9 x 3 y 3 + 325 12 x 3 y 4 .
S x J ( z ( x , y ) ) = 111 3 x 3 + 107 4 x 4 + 6 5 x 5 + 88 4 x 4 + 176 5 x 5 + 13 6 x 6 + 83 36 x 6 + 13 7 x 7 .
S x J ϕ x ϕ y ( z ( x , y ) ) = 222 3 x 3 + 321 4 x 4 + 24 5 x 5 + 352 4 x 4 + 1056 5 x 5 + 104 6 x 6 + 747 36 x 6 + 156 7 x 7 .
( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( z ( x , y ) ) = 888 x + 8521 8 x 2 + 38400 27 x 3 + 67163 64 x 4 + 22464 125 x 5 .
Now, these data in Table 1 immediately yield the aforementioned results.
ω ¯ 1 ( G ) = ( ϕ x + ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 2690 .
ω ¯ 2 ( G ) = ( ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 2982 .
F ¯ ( G ) = ( ϕ x 2 + ϕ y 2 ) ( ( z ( x , y ) ) ) | x = y = 1 = 6798 .
R Z ¯ ( G ) = ( ( ϕ x + ϕ y ) ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = y = 1 = 14956 .
ω ¯ 2 * ( G ) = ( S x S y ) ( ( z ( x , y ) ) ) | x = y = 1 = 155.93 .
S D D ¯ ( G ) = ( S x ϕ y + S y ϕ x ) ( ( z ( x , y ) ) ) | x = y = 1 = 1442.583 .
H ¯ ( G ) = ( S x J ) ( ( z ( x , y ) ) ) | x = 1 = 140.007 .
I S I ¯ ( G ) = ( S x J ϕ x ϕ y ) ( ( z ( x , y ) ) ) | x = 1 = 622.369 .
A Z ¯ ( G ) = ( S x 3 ψ 2 J ϕ x 3 ϕ y 3 ) ( z ( x , y ) ) | x = 1 = 4604.481 .
Display the graphical representations of the M ¯ -polynomials. We first create a horizontal grid using the x and y parameters, and then we build a surface on top of that grid. These graphs demonstrate diverse polynomial behavior depending on the parameters. By adjusting the polynomials using these parameters, we may regulate topological coindices and, therefore, a large number of features and activities.

3. Application

Consider the treatment for myelodysplastic syndrome (a group of conditions in which the bone marrow produces blood cells that are misshapen and does not produce enough healthy blood cells) with azacitidine. Azacitidine or decitabine belongs to the group of drugs known as demethylation agents. An experimental medication being tested for the treatment of acute myeloid leukemia and myelodysplastic syndrome is guadecitabine. Drug design in medical research depends on the chemical, physiological, biological, and pharmacological aspects of molecular structure. Different mathematical instruments include forecasting certain chemistries’ features, such as the topological index. The topological index allows us to link a single number to a molecular graph of a chemical complex. Polygonal forms, trees, graphs, and other geometrical shapes are widely used to represent drugs and other chemical compounds. In this study, we discuss the newly introduced invariants for the drugs azacitidine, decitabine, and guadecitabine (first Zagreb index, second Zagreb index, F-index, reformulated Zagreb index, modified Zagreb, symmetric division index, inverse sum index, harmonic index, and augmented Zagreb index). The goal of this study is to give the reader a current overview of drugs azacitidine, decitabine, and guadecitabines and drugs-based medications that are now used to treat patients as well as information on future therapeutic uses for these medications.

4. Conclusions

Building quantitative structure–activity relationships (QSAR), quantitative structure–property relationships (QSPR), and quantitative structure–toxicity relationships (QSTR) frequently uses topological indices (TIs) as molecular descriptors (QSTRs). In this article, we examine a few topological features of three concise drugs, azacitidine, decitabine, and guadecitabine, in terms of several DBTCIs. These three structures’ M-polynomials are first determined, and then specific DBTCIs are derived using these polynomials. We also produce the graphical representations of these polynomials in Figure 4b, Figure 5b and Figure 6b. These figures are 3D plots also known as surface plots used to represent three-dimensional data of the M-polynomial of (i) azacitidine, (ii) decitabine, (iii) guadecitabine. With our obtained results, the F-index and R Z -index, future studies will evaluate how well the DBTCI can forecast the physicochemical properties of various chemical compounds.

Author Contributions

Conceptualization Rashad Ismail, M.U.G.; and F.J.H.C.; methodology, M.U.G.; software, F.J.H.C. and H.K.; validation, K.P.; formal analysis, K.P.; investigation, M.U.G.; resources, K.P. and R.I.; data curation, F.J.H.C.; writing—original draft preparation, K.P.; writing—review and editing, K.P.; visualization, K.P.; supervision, F.J.H.C. and K.P.; project administration, M.N.H. All authors have read and agreed to the published version of the manuscript.

Funding

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Small Groups Project under grant number R.G.P.1/169/43.

Data Availability Statement

No data were used to support this study.

Acknowledgments

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Small Groups Project under grant number R.G.P.1/169/43.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kirmani, S.A.K.; Ali, P.; Azam, F. Topological indices and QSPR/QSAR analysis of some antiviral drugs being investigated for the treatment of COVID-19 patients. Int. J. Quantum Chem. 2021, 121, e26594. [Google Scholar] [CrossRef]
  2. Chaudhry, F.; Husin, M.N.; Afzal, F.; Afzal, D. M-polynomials and degree-based topological indices of tadpole graph. J. Discret. Math. Sci. Cryptogr. 2021, 24, 2059–2072. [Google Scholar] [CrossRef]
  3. Hameed, S.; Husin, M.N.; Afzal, F.; Hussain, H.; Afzal, D.; Farahani, M.R.; Cancan, M. On computation of newly defined degree-based topological invariants of Bismuth Tri-iodide via M-polynomial. J. Discret. Math. Sci. Cryptogr. 2021, 24, 2073–2091. [Google Scholar] [CrossRef]
  4. Kirmani, S.A.K.; Ali, P. CoM-polynomial and topological coindices of hyaluronic acid conjugates. Arab. J. Chem. 2022, 15, 103911. [Google Scholar] [CrossRef]
  5. Nagarajan, S.; Imran, M.; Kumar, P.M.; Pattabiraman, K.; Ghani, M.U. Degree-Based Entropy of Some Classes of Networks. Mathematics 2023, 11, 960. [Google Scholar] [CrossRef]
  6. Wang, Y.; Hafeez, S.; Akhter, S.; Iqbal, Z.; Aslam, A. The Generalized Inverse Sum Indeg Index of Some Graph Operations. Symmetry 2022, 14, 2349. [Google Scholar] [CrossRef]
  7. Zhang, Y.F.; Ghani, M.U.; Sultan, F.; Inc, M.; Cancan, M. Connecting SiO4 in Silicate and Silicate Chain Networks to Compute Kulli Temperature Indices. Molecules 2022, 27, 7533. [Google Scholar] [CrossRef] [PubMed]
  8. Ghani, M.U.; Sultan, F.; Tag El Din, E.S.M.; Khan, A.R.; Liu, J.B.; Cancan, M. A Paradigmatic Approach to Find the Valency-Based K-Banhatti and Redefined Zagreb Entropy for Niobium Oxide and a Metal–Organic Framework. Molecules 2022, 27, 6975. [Google Scholar] [CrossRef]
  9. Alaeiyan, M.; Bahrami, A.; Farahani, M.R. Cyclically domination polynomial of molecular graph of some nanotubes. Dig. J. Nanomater. Biostruct. 2011, 6, 143–147. [Google Scholar]
  10. Liu, Y.; Rezaei, M.; Farahani, M.R.; Husin, M.N.; Imran, M. The omega polynomial and the cluj-ilmenau index of an infinite class of the titania nanotubes TiO2(m,n). J. Comput. Theor. Nanosci. 2017, 14, 3429–3432. [Google Scholar] [CrossRef]
  11. Husin, M.N.; Zafar, S.; Gobithaasan, R.U. Investigation of atom-bond connectivity indices of line graphs using subdivision approach. Math. Probl. Eng. 2022, 6219155. [Google Scholar] [CrossRef]
  12. Modabish, A.; Husin, M.N.; Alameri, A.Q.; Ahmed, H.; Alaeiyan, M.; Farahani, M.R.; Cancan, M. Enumeration of spanning trees in a chain of diphenylene graphs. J. Discret. Math. Sci. Cryptogr. 2022, 25, 241–251. [Google Scholar] [CrossRef]
  13. Ali, F.; Rather, B.A.; Fatima, N.; Sarfraz, M.; Ullah, A.; Alharbi, K.A.M.; Dad, R. On the topological indices of commuting graphs for finite non-Abelian groups. Symmetry 2022, 14, 1266. [Google Scholar] [CrossRef]
  14. Husin, M.N.; Ariffin, A. On the edge version of topological indices for certain networks. Ital. J. Pure Appl. Math. 2022, 47, 550–564. [Google Scholar]
  15. Yu, Z.; Xu, L.; Yin, S.; Guo, L. Super Vertex (Edge)-Connectivity of Varietal Hypercube. Symmetry 2022, 14, 304. [Google Scholar] [CrossRef]
  16. Ali, S.; Ismail, R.; Campena, F.J.H.; Karamti, H.; Usman, M.G. On Rotationally Symmetrical Planar Networks and Their Local Fractional Metric Dimension. Symmetry 2023, 15, 530. [Google Scholar] [CrossRef]
  17. Eliasi, M.; Iranmanesh, A. Hosoya polynomial of hierarchical product of graphs. MATCH Commun. Math. Comput. Chem 2013, 69, 111–119. [Google Scholar]
  18. Hosoya, H. On some counting polynomials in chemistry. Discret. Appl. Math. 1988, 19, 239–257. [Google Scholar] [CrossRef] [Green Version]
  19. Lin, X.; Xu, S.J.; Yeh, Y.N. Hosoya polynomials of circumcoronene series. MATCH Commun. Math. Comput. Chem 2013, 69, 755–763. [Google Scholar]
  20. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef]
  21. Bartlett, A.C.; Hollot, C.V.; Lin, H. Root locations of an entire polytope of polynomials: It suffices to check the edges. Math. Control. Signals Syst. 1988, 1, 61–71. [Google Scholar] [CrossRef]
  22. Brown, J.; Dilcher, K.; Nowakowski, R. Roots of independence polynomials of well covered graphs. J. Algebr. Comb. 2000, 11, 197–210. [Google Scholar] [CrossRef]
  23. Brown, J.; Hickman, C.; Nowakowski, R. On the location of roots of independence polynomials. J. Algebr. Comb. 2004, 19, 273–282. [Google Scholar] [CrossRef]
  24. Brown, J.I.; Nowakowski, R.J. Average independence polynomials. J. Comb. Theory Ser. B 2005, 93, 313–318. [Google Scholar] [CrossRef] [Green Version]
  25. Brown, J.I.; Nowakowski, R.J. Bounding the roots of independence polynomials. Ars Comb. 2001, 58, 113–120. [Google Scholar]
  26. Deutsch, E.; Klavzar, S. Computing Hosoya polynomials of graphs from primary subgraphs. arXiv 2012, arXiv:1212.3179. [Google Scholar]
  27. Shanmukha, M.; Usha, A.; Shilpa, K.; Basavarajappa, N. M-polynomial and neighborhood M-polynomial methods for topological indices of porous graphene. Eur. Phys. J. Plus 2021, 136, 1–16. [Google Scholar] [CrossRef]
  28. Kirmani, S.A.K.; Ali, P.; Ahmad, J. Topological Coindices and Quantitative Structure-Property Analysis of Antiviral Drugs Investigated in the Treatment of COVID-19. J. Chem. 2022, 2022, 3036655. [Google Scholar] [CrossRef]
  29. Chu, Y.M.; Khan, A.R.; Ghani, M.U.; Ghaffar, A.; Inc, M. Computation of zagreb polynomials and zagreb indices for benzenoid triangular & hourglass system. Polycycl. Aromat. Compd. 2022, 1–10. [Google Scholar] [CrossRef]
  30. Tag El Din, E.S.M.; Sultan, F.; Ghani, M.U.; Liu, J.B.; Dehraj, S.; Cancan, M.; Alharbi, F.M.; Alhushaybari, A. Some Novel Results Involving Prototypical Computation of Zagreb Polynomials and Indices for SiO4 Embedded in a Chain of Silicates. Molecules 2022, 28, 201. [Google Scholar] [CrossRef]
  31. Ghani, M.U.; Campena, F.J.H.; Ali, S.; Dehraj, S.; Cancan, M.; Alharbi, F.M.; Galal, A.M. Characterizations of Chemical Networks Entropies by K-Banhatii Topological Indices. Symmetry 2023, 15, 143. [Google Scholar] [CrossRef]
  32. Ghani, M.U.; Kashif Maqbool, M.; George, R.; Ofem, A.E.; Cancan, M. Entropies Via Various Molecular Descriptors of Layer Structure of H3BO3. Mathematics 2022, 10, 4831. [Google Scholar] [CrossRef]
  33. Alam, A.; Ghani, M.U.; Kamran, M.; Shazib Hameed, M.; Hussain Khan, R.; Baig, A. Degree-Based Entropy for a Non-Kekulean Benzenoid Graph. J. Math. 2022, 2022, 2288207. [Google Scholar]
  34. Derissen, E.J.; Beijnen, J.H.; Schellens, J.H. Concise drug review: Azacitidine and decitabine. Oncologist 2013, 18, 619–624. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  35. Garcia-Manero, G.; Roboz, G.; Walsh, K.; Kantarjian, H.; Ritchie, E.; Kropf, P.; O’Connell, C.; Tibes, R.; Lunin, S.; Rosenblat, T.; et al. Guadecitabine (SGI-110) in patients with intermediate or high-risk myelodysplastic syndromes: Phase 2 results from a multicentre, open-label, randomised, phase 1/2 trial. Lancet Haematol. 2019, 6, e317–e327. [Google Scholar] [CrossRef]
  36. Berhe, M.; Wang, C. Computation of certain topological coindices of graphene sheet and C4C8(S) nanotubes and nanotorus. Appl. Math. Nonlinear Sci. 2019, 4, 455–468. [Google Scholar] [CrossRef] [Green Version]
  37. Rehman, M.U.; Salman, M.; Khan, S.; Maden, A.D.; Ali, F. Mostar index of graphs associated to groups. Main Group Met. Chem. 2022, 45, 124–135. [Google Scholar] [CrossRef]
Figure 1. Azacitidine drug ( C 8 H 12 N 4 O 5 ).
Figure 1. Azacitidine drug ( C 8 H 12 N 4 O 5 ).
Symmetry 15 00603 g001
Figure 2. Decitabine drug ( C 8 H 12 N 4 O 4 ).
Figure 2. Decitabine drug ( C 8 H 12 N 4 O 4 ).
Symmetry 15 00603 g002
Figure 3. Guadecitabine drug ( C 18 H 24 N 9 O 10 P ).
Figure 3. Guadecitabine drug ( C 18 H 24 N 9 O 10 P ).
Symmetry 15 00603 g003
Figure 4. (a) The chemical structure of azacitidine (b) The 3D plots for M ¯ -polynomial of azacitidine.
Figure 4. (a) The chemical structure of azacitidine (b) The 3D plots for M ¯ -polynomial of azacitidine.
Symmetry 15 00603 g004
Figure 5. (a) The chemical structure of decitabine. (b) The 3D plots for M ¯ -polynomial of decitabine.
Figure 5. (a) The chemical structure of decitabine. (b) The 3D plots for M ¯ -polynomial of decitabine.
Symmetry 15 00603 g005
Figure 6. (a) The chemical structure of guadecitabine. (b) The 3D plots for M ¯ -polynomial of guadecitabine.
Figure 6. (a) The chemical structure of guadecitabine. (b) The 3D plots for M ¯ -polynomial of guadecitabine.
Symmetry 15 00603 g006
Figure 7. The molecular graph of azacitidine.
Figure 7. The molecular graph of azacitidine.
Symmetry 15 00603 g007
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ghani, M.U.; Campena, F.J.H.; Pattabiraman, K.; Ismail, R.; Karamti, H.; Husin, M.N. Valency-Based Indices for Some Succinct Drugs by Using M-Polynomial. Symmetry 2023, 15, 603. https://doi.org/10.3390/sym15030603

AMA Style

Ghani MU, Campena FJH, Pattabiraman K, Ismail R, Karamti H, Husin MN. Valency-Based Indices for Some Succinct Drugs by Using M-Polynomial. Symmetry. 2023; 15(3):603. https://doi.org/10.3390/sym15030603

Chicago/Turabian Style

Ghani, Muhammad Usman, Francis Joseph H. Campena, K. Pattabiraman, Rashad Ismail, Hanen Karamti, and Mohamad Nazri Husin. 2023. "Valency-Based Indices for Some Succinct Drugs by Using M-Polynomial" Symmetry 15, no. 3: 603. https://doi.org/10.3390/sym15030603

APA Style

Ghani, M. U., Campena, F. J. H., Pattabiraman, K., Ismail, R., Karamti, H., & Husin, M. N. (2023). Valency-Based Indices for Some Succinct Drugs by Using M-Polynomial. Symmetry, 15(3), 603. https://doi.org/10.3390/sym15030603

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop