1. Introduction
Graph theory is a mathematical modeling method that explains the way objects are related to each other by connecting them with graphs called edges. Arthur Cayley [
1] played a pivotal role in the resurgence of graph theory applications within the field of chemistry, ultimately giving birth to what we now know as chemical graph theory [
2]. In this branch, the atoms organizing a molecule are considered as points; bonds between atoms are considered as edges. Then, the concept of a topological index becomes involved, whose final value is obtained from the values extracted from the molecular graph model. Topological indices are formulas that enable us to predict the physicochemical data of molecules, obtained through long experimental processes with mathematical calculations. In this way, it is possible to gain recoup losses arising from parameters such as time, equipment, budget, and environment during the experimental process. Topological indices can be decomposed into distance- and degree-based indices. The Wiener index [
3], Zagreb indices [
4], Randic index [
5], Balaban index [
6], and Hosoya [
7] and Forgotten topological indices [
8] are the leading ones. While taking into account the number of other vertices to which a vertex is connected for degree-based indices, distance-based indices take the shortest path between two points as a basis. For novel and further properties of topological indices, we also refer the reader to [
9,
10,
11,
12], where further references can be found. It may not always be easy or even possible to make formulary calculations among hundreds of topological indices. To eliminate this difficulty and also in order to have information about the topological surface, a computing method has already been developed using algebraic polynomials. For instance, in the domain of distance-based topological indices, the Wiener polynomial is a general polynomial whose derivatives at 1 yield Weiner and hyper-Wiener indices [
13]. It can be predicted that finding the shortest path between any two points in a complex graph structure may not always be easy. Most of the time, the need to use algorithms may be felt. Similarly, for the degree-based topological indices, M- and NM-polynomials were defined in [
14] and [
15], respectively, and given as follows:
where
,
,
, and the number of edges
such that
for the degrees
and
of
in
G. In addition,
where
,
,
, and the number of edges
such that
for the neighborhood degrees
and
of
in
G.
Over time, in parallel with the topological indices, topological coindices, calculated according to the values taken from the complement of the molecular graph, have been added to the literature (see [
12,
16] for details). The complement graph
was obtained by plotting the relationship between non-adjacent pairs of points of a graph
G [
16]. The indices calculated based on this new structure are also called topological coindices, and just as the others, it is possible to classify them based on degree and distance. For example, the first and the second Zagreb coindices were introduced by Doslic in [
17] as follows:
and
where the degrees
and
indicate the number of vertices that are non-adjacent to
a and
b, respectively. Later, the multiplicative Zagreb coindices [
18], forgotten topological coindex [
19], second modified Zagreb coindex [
20], redefined third Zagreb coindex [
20], Randic coindex [
20], inverse Randic coindex [
20], symmetric division coindex [
20], harmonic coindex [
20], inverse sum indeg coindex [
20], and augmented Zagreb coindex [
20] were also defined and studied. In 2022, Kirmani et al. [
20] introduced and studied CoM-polynomials as an alternative way to compute topological coindices. Additionally, some recent studies can be presented as examples of the applications of degree-based topological indices computed via the mentioned polynomials in QSPR analysis (see [
21,
22,
23,
24] and references therein).
Topological indices and algebraic graph theory share a common focus on the analysis and representation of graphs. Topological indices offer a distinctive set of numerical measurements derived from graph topology. On the other hand, algebraic graph theory provides mathematical tools and concepts that enable the analysis and comprehension of graph features. These tools are effectively utilized to investigate and gain insights into topological indices, thereby establishing a mutual relationship between the two. Graphs with commutative rings are employed in robotics, information and communication theory, elliptic curve cryptography, physics, and statistics. The constructed graphs from algebraic structures exhibit remarkable properties that showcase their high degree of symmetry. These properties establish a significant connection between chemical graph theory and network utilized in parallel computing. The ring structure’s graphs have also been applied in molecular graphs and the structures of genetic code [
25]. Nowadays, studies on the zero divisor graph of the ring
are a trending field in spectral and chemical graph theory (see [
26,
27,
28,
29] for details). Studies on these topics in the literature motivated us to study computing different descriptors with respect to a prime ideal sum graph. The prime ideal sum graph of a commutative ring was defined in [
30]. For a commutative ring
R with identity, the prime ideal sum graph of
R is a graph whose vertices are nonzero proper ideals of
R, and two distinct vertices
I and
J are adjacent if and only if
is a prime ideal of
. They studied some connections between the graph-theoretic properties of this graph and some algebraic properties of rings (see [
30] for more details).
The main goals of the present paper are to compute some topological indices first Zagreb index (), second Zagreb index (), second modified Zagreb index (), redefined third Zagreb index (), forgotten topological index (), symmetric division index (), harmonic index (), inverse sum indeg index (), and augmented Zagreb index () and the topological coindex version each of them, which are related to the complement of the graph of for , where and s are distinct primes. Furthermore, we construct M-polynomials and -polynomials using the -graph structure of to avoid the difficulty of calculating descriptors via formulas directly. Furthermore, we discuss applications of the M-polynomials and -polynomials of molecular graphs in order to shed light on the topological structures of the taken molecules. The paper ends with conclusions and directions for future research.
2. Motivation behind Topological Indices over Algebraic Graphs
In chemistry, group theory is used to study the symmetries and the crystal structures of objects whenever an object or a system property is invariant under transformation. The idea of constructing a graph from groups was advanced by Arthur Cayley, since an algebraic structure is essential for the development of chemical systems as well as the study of many chemical properties of molecules contained within these structures. The study of graphs from rings commences with the exploration of the thoroughly-researched zero-divisor graphs derived from commutative rings [
31]. The other well-studied graphs produced from rings can be listed as annihilating ideal graphs [
32], comaximal graphs [
33,
34], Cayley graphs [
35], prime ideal sum graphs, total graph [
36], etc.
Since topological indices are the numerical quantity of a network and are invariant under graph isomorphisms, researchers are interested in examining the physical properties and symmetries of algebraic structures through graph representations, similar to those in chemistry. In addition, graphs constructed from rings are finite structures, and finite rings and fields have received a significant amount of focus for their applications in cryptography and coding theory [
37,
38,
39]. In [
40,
41,
42], the authors computed vertex-based eccentric and edge-based topological indices of zero-divisor graphs of
, where
, and
r are primes. They pointed out the benefits of these indices in understanding the characteristics of different physical structures such as carbon nanostructures, hexagonal belts and chains, fullerenes and nanocones, structure boiling points, and the relationships of various alkanes. Moreover, they have significance in estimating and troubleshooting computer network problems and developing efficient physical structure in robotics.
In particular, in a recent study (2023) entitled “Applications on Topological Indices of Zero-Divisor Graph Associated with Commutative Rings”, it was declared that computed values for topological indices over algebraic graphs help understand the characteristics of various symmetric physical structures of finite commutative rings and have received significant focus for their applications to cryptography, coding theory, robotics, and mechanics [
43,
44]. These predictions are also supported by the following recent articles, as the graphs constructed from rings were highly symmetric [
45,
46,
47]. Another article published in Nature Communications [
48], entitled “Algebraic Graph-Assisted Bidirectional Transformers for Molecular Property Prediction”, shows promise that algebraic graph theory with the applications of topological indices will gain a place in interdisciplinary applications in the near future. Our prediction is that topological indices will be active in the optimization of applications/systems developed using algebraic graphs [
49].
Inspired by the abovementioned studies, in
Section 6, we contribute to this literature by computing prime ideal sum graphs of commutative rings. Precisely, we discuss some applications of algebraic graphs to chemical graph theory.
6. Applications in Chemistry
In the present section, we discuss applications of algebraic graph theory in chemistry. We aim to present a chemical application to emphasize the positive impact of degree-based topological (co)indices on QSAR analysis. Our statistical analysis verifies that the study’s topological descriptors are good predictors of various bioactivity properties of the seven anti-Alzheimer drug candidates.
Significant contributions have been made in the field of investigating the predictive potential of different classes of graph-theoretic indices. The first study combining topological descriptors with QSAR analysis was carried out in [
51]. Another study was undertaken by Gutman and Tošovic [
52], who initiated a comprehensive examination to evaluate the efficacy of degree-based topological indices in predicting the physicochemical properties of isomeric octanes. In [
53], Malik et al. broadened their research scope, moving beyond isomeric octanes to encompass benzenoid hydrocarbons, in order to establish correlations between various physicochemical properties. Furthermore, Hayat et al. [
54] extended their study to lower polycyclic aromatic hydrocarbons for correlating the
-electron energy. Hayat and Asmat [
55] discovered the optimal value of
that yields the strongest correlation between the generalized first Zagreb index
and the
-electron energy of lower benzenoid hydrocarbons. Arif et al. [
56] explored the predictive capacity of degree-based irregularity indices concerning the physicochemical characteristics of monocarboxylic acids. In [
57,
58], the authors expanded upon previous research, investigating the predictive potential of topological indices, shifting the focus from degree-based indices to distance-based indices. References [
59,
60,
61,
62,
63] can also be cited for eigenvalues-based indices and their ability to predict various properties. In this part of the study, we harnessed QSAR modeling to perform an elaborate regression analysis, showcasing its predictive power in relation to our degree-based topological descriptors.
With this aim, we chose seven compounds (Compound 1, Compound 2, Compound 3, Compound I, Compound III, Compound IV, and Compound VI) that were claimed as effective Alzheimer’s disease drug candidates by testing limited experimental methods in [
64,
65]. Now, we will explain in detail, for one of the compounds (Compound 3), that the calculations we made for algebraic graphs are similar for chemical graphs. Let
be the chemical graph of Compound 3 taken from [
64]. The compound’s molecular graph contains 39 vertices and 41 edges as follows (see
Table 3 below):
Since the vertex partition of the chemical compound is as above, we have , , , .
Additionally, if
:
and
, then the coefficients of the
M-polynomial and also the coefficients of the
-polynomial of the chemical compound can be determined as follows using the edge-partition technique.
Hence, the polynomials are obtained as follows:
When similar processes are applied to the remaining molecules in order to calculate the topological indices, we obtain the results given in
Table 4 below.
The following equations give the mathematical connection between features and topological indices that are well correlated in predicting bioactivity properties (see
Table 5), with curvilinear regression analysis in exponential form (obtained by SPSS (21.0.)). The fitted curves summarizing this situation are given in
Figure 15. The notations R and SE given in the equations state the correlation coefficient and standard error, respectively.
7. Conclusions
Studying algebraic graph theory has high significance in view of combining representation and number theory via combinatoric applications. Applications of finite rings and other fields provide a solid background to cryptology and coding theory. Computing different types of topological indices of algebraic graphs gives an idea about the physical properties of related finite commutative rings. Investigating their different polynomial forms also enables designing new and stronger physical structures in mechanics for robotics. When combining this graph-theoretic-based mathematical modeling with artificial intelligence and mechanic science, it is possible to provide time and budget savings while producing solutions for various computer-network problems. Studying zero-divisor graphs over is now a trending field for understanding the physical properties of algebraic structures and is also important for the spectral branch of graph theory.
In this study, we computed some topological indices and coindices that are related to the graph complement of the graph of , where and for different prime integers , and s, to simplify the process of computing and also obtain an idea of the physical structures of commutative rings. Additionally, we handled some algebraic polynomials called M-polynomials and -polynomials. Both polynomials can be used by researchers in the future, for example, by using QSPR/QSAR analysis in chemistry and in other applied sciences such as cryptology, code theory, and mechanics. Finally, we discussed the applicability of algebraic graphs to chemical graph theory. Studying QSPR/QSAR analysis might be attractive for further studies in the near future. We conclude this section with the following open problem based on the reviewers’ comments:
Problem 1. How can we construct the M-polynomials and -polynomials to compute the degree-based topological (co)indices of the graph of , where for the different prime integers , and ?