Abstract
Chemical graph theory has made a significant contribution to understand the chemical compound properties in the modern era of chemical science. At present, calculation of the topological indices is one of most important area of research in the field of chemical graph theory. Cyclodecane is a cyclic hydrocarbon with the chemical formula \(C_{10}H_{20}\). It consists of a ring of ten carbon atoms bonded together in a cyclical structure. Cyclodecane chains can be part of larger molecules or polymers, where multiple cyclodecane rings are connected together. These molecules can have various applications in chemistry, materials science, and pharmaceuticals. This article aims to determine expected values of some connectivity based topological indices of random cyclodecane chains, containing saturated hydrocarbons with at least two rings. It also compares these descriptors using explicit formulae, numerical tables and present graphical profiles of these comparisons.
Similar content being viewed by others
Introduction
Chemical graph theory is a branch of graph theory that focuses on the study of graphs to model and understand molecular structures and chemical reactions. In this context, atoms are represented as vertices (nodes), and chemical bonds are represented as edges connecting these vertices. It provides a powerful framework for understanding molecular structures, properties, and reactions, and plays a central role in many areas of chemistry, biochemistry, and materials science. Chemical graph theory is used to predict molecular structures based on connectivity information. Algorithms such as the Morgan algorithm or the famous Wiener index can be used to generate molecular structures or predict properties like molecular shape, size, and symmetry. QSAR studies correlate the chemical structure of molecules with their biological activity or other properties. Graph-based descriptors derived from chemical graphs, such as topological indices, connectivity indices, and molecular fingerprints, are utilized to quantify structural features and predict biological activity.
A topological index is a numerical value assigned to a molecular structure based solely on its topology, or connectivity pattern, without considering bond lengths or angles. These indices are used in chemical graph theory and quantitative structure-activity relationship (QSAR) studies to correlate molecular structure with physical, chemical, or biological properties. Topological indices provide a simplified representation of molecular structure, facilitating the comparison of molecules and the prediction of their properties. There are many degree and distance based topological indices introduced in literature but some of them are better because of their correlation with chemical properties such as high boiling point, strain energy and stability. The degree based topological indices link specific physicochemical characteristics of several chemical substances. For more detail on various topological indices, see1,2,3,4,5,6,7,8,9,10,11. The name molecular descriptor was introduced for the Z-index12. For details, see13,14,15. The quantitative structure property relationship (QSPR) and the quantitative structure activity relationship (QSAR) are two areas in which topological indices have particularly vital role in mathematical chemistry16,17.
A graph \(\Upsilon \) is made up of two finite sets, vertices and edges. The degree of the vertex \(\upsilon \) is the number of edges that incident at vertex \(\upsilon \) in \(\Upsilon \) and it is denoted by the symbol \(d(\upsilon )\). For basic terminologies related to graph theory, the readers can see10. The Randić index18, first introduced by Milan Randić in 1975, measures molecular branching of chemical compounds in graph theory. The mathematical formula of Randić index is
It is useful in quantitative structure-activity relationship (QSAR) studies in chemistry, correlated with properties like boiling points, enthalpies, and molecular weights. It captures information about molecular structure branching and connectivity, making it a valuable tool in chemical graph theory and molecular graph analysis. Details on these applications can be found in the books19,20,21. The General Randić index22, also known as the General Randić connectivity index, is an extension of the Randić index, focusing on the molecular branching of chemical compounds. The general Randic index of a graph \(\Upsilon \) is defined as
The Atom-Bond Connectivity (ABC) index23 is a mathematical tool in chemistry used to analyze the structure of molecules, measure their complexity. The mathematical formula of ABC index is
It is used in Quantitative Structure-Activity Relationship studies, molecular descriptors and cheminformatics to study interactions, describe molecules and analyze chemical data24,25. The Atom-Bond Sum Connectivity (ABS) index26 is a topological index used in chemical graph theory to quantify the molecular structure of chemical compounds. It provides a numerical descriptor of molecular structure, useful in computational chemistry, quantitative structure-activity relationship studies, and other areas. It captures information about atom connectivity and bond types, enabling correlation with molecular properties and activities. It is defined as
The geometric arithmetic index27, which combines geometric and arithmetic mean values of molecular graph properties, helps chemists understand molecule structural characteristics and predict their behavior in chemical processes or biological activities. The geometric arithmetic index of a graph \(\Upsilon \) has the mathematical formula
The paper is structured as follows: In Section “Materials and methods”, we discuss the 2D and 3D models of cyclodecanes and their properties. We explain the construction of random cyclodecane chains, and we have obtained general formulas for some connectivity-based topological indices. In Section “Main results and discussions”, we compute explicit expressions for the connectivity-based topological indices of random cyclodecane chains. The expressions for the expected values of these topological descriptors are obtained for some special cases. An analytical comparison between the expected values of these topological descriptors is presented in Section “Comparison between the expected values of topological descriptors”. Finally, the conclusion section summarizes the article.
Materials and methods
Cyclodecane is a ten-carbon ring with ten membered rings, with two possible isomers, cis-cyclodecane and trans-cyclodecane (see Fig. 1). It undergoes Bergmann cyclization to produce diradical products that inhibit cell replication and interact with DNA. The 2D chemical structure of cyclodecane, also known as the skeletal formula, is the standard notation for organic molecules. Carbon atoms are located at the corner(s) and hydrogen atoms are not indicated. Each carbon atom is associated with enough hydrogen atoms to form four bonds. The 3D chemical structure image of cyclodecane uses a ball-and-stick model, displaying atom positions and bonds. The radius of spheres is smaller than rod lengths, allowing for a clearer view of atoms and bonds. In comparison to typical polymers, cyclodecane-based monomers enable polymer synthesis, resulting in unique polymers with cyclodecane-containing characteristics. Cyclodecane may impact the crystal structure of certain compounds, particularly those with coordination complexes or molecular assemblies, affecting the packing arrangement and overall properties of the crystal lattice. The chemical structure of a molecule contains the arrangement of its atoms and the bonds that hold them together. Cyclocodecane has 30 bonds, including 10 non-hydrogen bonds and 1 ten-numbered ring. The 2D and 3D models of cyclodecane chains are depicted in Fig. 1. The structure of the cyclodecane chain is chemical as well. Some of the characteristics of cyclodecane chains are: Molecular Weight 140.27 g/mol, Melting Point \(10.0^{\circ }C\), Boiling Point \(202.0^{\circ }C\), Health Risk 0.33 mg/L, Water Solubility \(25^{\circ }C\) and Vapour Pressure 0.56 mmHg.
Researcher have focused on hydrocarbons and their derivatives because of their simple structure have two components carbon and hydrogen. Numerous kinds of hydrocarbon derivatives can be obtained by substituting their molecular hydrogen atoms with various other atomic groups. Plants contains a significant amount of precious hydrocarbons and some of these hydrocarbons properties are important in the production of chemical raw material and fuel. A cycloalkane with the chemical formula \(C_{10}H_{20}\) is cyclodecane. When an edge is used to join the two or more decagons then it is known as cyclodecane chain. A random cyclodecane of length k is a chain containing k decagons which are connected to each other by edge in a random way. We use the notation \(\mathbb {CDC}_{k}\) to denote a random cyclodecane chain containing k decagons. Figure 2 shows the unique cyclodecane \(\mathbb {CDC}_{k}\) for \(k=1,2\). There are five possible ways to connect a terminal decagon with the cyclodecane chain \(\mathbb {CDC}_{k-1}\) with probability \(\delta _{1}\), \(\delta _{2}\), \(\delta _{3}\), \(\delta _{4}\), and \(\delta _{5}=1-\delta _{1}-\delta _{2}-\delta _{3}-\delta _{4}\) respectively. A random selection is made from one of the five possibilities at each step \((q=3,4,5,...,k)\):
-
(i)
\(\mathbb {CDC}_{q-1}\rightarrow \mathbb {CDC}^1_q\) with probability \(\delta _{1}\).
-
(ii)
\(\mathbb {CDC}_{q-1}\rightarrow \mathbb {CDC}^2_q\) with probability \(\delta _{2}\).
-
(iii)
\(\mathbb {CDC}_{q-1}\rightarrow \mathbb {CDC}^3_q\) with probability \(\delta _{3}\).
-
(iv)
\(\mathbb {CDC}_{q-1}\rightarrow \mathbb {CDC}^4_q\) with probability \(\delta _{4}\).
-
(v)
\(\mathbb {CDC}_{q-1}\rightarrow \mathbb {CDC}^5_q\) with probability \(\delta _{5}=1-\delta _{1}-\delta _{2}-\delta _{3}-\delta _{4}\).
For \(k=3\), we have five different possible cyclodecane chains (see Fig. 3). The five different configurations of cyclodecane chains \(\mathbb {CDC}^1_{k+1}\), \(\mathbb {CDC}^2_{k+1}\), \(\mathbb {CDC}^3_{k+1}\), \(\mathbb {CDC}^4_{k+1}\) and \(\mathbb {CDC}^5_{k+1}\) are shown in Fig. 4. For results on the expected values of different topological indices of random structures see28,29,30,31,32,33,34,35,36,37,38.
In this section, we compute the expected values of geometric-arithmetic index, atom-bound connectivity index, atom-bound-sum connectivity index, Randić index and general Randić index for \(\mathbb {CDC}_{k}\) chain having k decagons. Consider \(\mathbb {CDC}_{k}\) to be the cyclodecane chain formed from \(\mathbb {CDC}_{k-1}\), as illustrated in Fig. 4. We use the notation \(\upsilon _{ij}\) to denote the number of edges of \(\mathbb {CDC}_{k}\) whose end vertices have degree i and j respectively. The structure of the chain \(\mathbb {CDC}_{k}\) clearly shows that it comprises only (2, 2), (2, 3), and (3, 3) type edges. To calculate these indices for the chain \(\mathbb {CDC}_{k}\), we need to find the edges of the type \(\upsilon _{22}(\mathbb {CDC}_{k})\), \(\upsilon _{23}(\mathbb {CDC}_{k})\) and \(\upsilon _{33}(\mathbb {CDC}_{k})\). Using this information, Eqs. (1), (2), (3), (4) and (5) can be written as:
Main results and discussions
For \(k\ge 3\), the cyclodecane chain \(\mathbb {CDC}_{k}\) is a random structure. It follows \(GA(\mathbb {CDC}_k)\), \(ABC(\mathbb {CDC}_k)\), \(ABS(\mathbb {CDC}_k)\), \(R(\mathbb {CDC}_k)\) and \(GR(\mathbb {CDC}_k)\) are random variables. We use the notaions \(E^{GA}(\mathbb {CDC}_k)=E[GA(\mathbb {CDC}_k)]\), \(E^{ABC}(\mathbb {CDC}_k)=E[ABC(\mathbb {CDC}_k)]\), \(E^{ABS}(\mathbb {CDC}_k)=E[ABS(\mathbb {CDC}_k)]\), \(E^{R}(\mathbb {CDC}_k)=E[R(\mathbb {CDC}_k)]\) and \(E^{GR}(\mathbb {CDC}_k)=E[GR(\mathbb {CDC}_k)]\) to denote their expected values respectively.
Theorem 1
Let \(k\ge 2\), then the expected value of the Geometric-Arithmetic index of \(\mathbb {CDC}_k\) is
Proof
For \(k=2\), we get \(E^{GA}(\mathbb {CDC}_2) = 20.9192\) which is indeed true. Let \(k \ge 3\), then there are five possibilities.
a) If \( \mathbb {CDP}_{-k1} \longrightarrow \mathbb {CDC}^{1}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{1}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+7\), \(\upsilon _{23}(\mathbb {CDC}^{1}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+2\) and \(\upsilon _{33}(\mathbb {CDC}^{1}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+2\). Using these values in Eq. (6), we get
b) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{2}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{2}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{2}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{2}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (6), we get
c) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{3}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{3}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{3}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{3}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (6), we get
d)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{4}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{4}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{4}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{4}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (6), we get
e) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{5}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{5}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{5}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{5}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (6), we get
Thus, we have
Since \(E[E^{GA}(\mathbb {CDC}_k)] = E^{GA}(\mathbb {CDC}_k)\), it follows that
Finally, solving the the recurrence relation by using the initial condition \(E(\mathbb {CDC}_2)=20.9192\), we get
\(\square \)
Theorem 2
Let \(k\ge 2\), then the expected value of the atom-bound connectivity index of \(\mathbb {CDC}_k\) is
Proof
For \(k=2\), we get \(E^{ABC}(\mathbb {CDC}_2) = 14.81\) which is indeed true. Let \(k \ge 3\), then there are five possibilities.
a) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{1}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{1}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+7\), \(\upsilon _{23}(\mathbb {CDC}^{1}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+2\) and \(\upsilon _{33}(\mathbb {CDC}^{1}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+2\). Using these values in Eq. (7), we get
b) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{2}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{2}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{2}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{2}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (7), we get
c) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{3}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{3}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{3}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{3}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (7), we get
d)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{4}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{4}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{4}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{4}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (7), we get
e)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{5}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{5}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{5}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{5}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (7), we get
Thus, we have
since \(E[E^{ABC}(\mathbb {CDC}_k) ] = E^{ABC}(\mathbb {CDC}_k)\), it follows that
Finally, solving the the recurrence relation by using the initial condition \(E(\mathbb {CDC}_2)=14.81\), we get
\(\square \)
Theorem 3
Let \(k\ge 2\), then the expected value of the atom-bound-sum connectivity index of \(\mathbb {CDC}_k\) is
Proof
For \(k=2\), we get \(E^{ABS}(\mathbb {CDC}_2) = 15.2286\) which is indeed true. Let \(k \ge 3\), then there are five possibilities.
a) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{1}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{1}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+7\), \(\upsilon _{23}(\mathbb {CDC}^{1}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+2\) and \(\upsilon _{33}(\mathbb {CDC}^{1}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+2\). Using these values in Eq. (8), we get
b) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{2}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{2}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{2}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{2}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (8), we get
c) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{3}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{3}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{3}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{3}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (8), we get
d)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{4}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{4}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{4}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{4}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (8), we get
e)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{5}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{5}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{5}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{5}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (8), we get
Thus, we have
Since \(E[E^{ABS}(\mathbb {CDC}_k) ] = E^{ABS}(\mathbb {CDC}_k)\), it follows that
Finally, solving the the recurrence relation by using the initial condition \(E(\mathbb {CDC}_2)=15.2286\), we get
\(\square \)
Theorem 4
Let \(k\ge 2\), then the expected value of the Randić index of \(\mathbb {CDC}_k\) is
Proof
For \(k=2\), we get \(E^{R}(\mathbb {CDC}_2) = 9.9663\) which is indeed true. Let \(k \ge 3\), then there are five possibilities.
a) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{1}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{1}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+7\), \(\upsilon _{23}(\mathbb {CDC}^{1}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+2\) and \(\upsilon _{33}(\mathbb {CDC}^{1}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+2\). Using these values in Eq. (9), we get
b) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{2}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{2}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{2}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{2}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (9), we get
c) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{3}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{3}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{3}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{3}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (9), we get
d)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{4}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{4}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{4}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{4}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (9), we get
e) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{5}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{5}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{5}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{5}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (9), we get
Thus, we have
Since \(E[E^{R}(\mathbb {CDC}_k) ] = E^{R}(\mathbb {CDC}_k)\), it follows that
Finally, solving the the recurrence relation by using the initial condition \(E(\mathbb {CDC}_2)=9.9663\), we get
\(\square \)
Theorem 5
Let \(k\ge 2\), then the expected value of the general Randić index of \(\mathbb {CDC}_k\) is
Proof
For \(k=2\), we get \(E^{R}(\mathbb {CDC}_2) = 16(4^{\gamma })+4(6^{\gamma })+9^{\gamma }\) which is indeed true. Let \(k \ge 3\), then there are five possibilities.
a) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{1}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{1}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+7\), \(\upsilon _{23}(\mathbb {CDC}^{1}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+2\) and \(\upsilon _{33}(\mathbb {CDC}^{1}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+2\). Using these values in Eq. (10), we get
b) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{2}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{2}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{2}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{2}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (10), we get
c) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{3}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{3}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{3}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{3}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (10), we get
d)If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{4}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{4}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{4}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{4}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (10), we get
e) If \( \mathbb {CDC}_{k-1} \longrightarrow \mathbb {CDC}^{5}_{k}\), then \(\upsilon _{22}(\mathbb {CDC}^{5}_{k}) = \upsilon _{22}(\mathbb {CDC}_{k-1})+6\), \(\upsilon _{23}(\mathbb {CDC}^{5}_{k}) = \upsilon _{23}(\mathbb {CDC}_{k-1})+4\) and \(\upsilon _{33}(\mathbb {CDC}^{5}_{k}) = \upsilon _{33}(\mathbb {CDC}_{k-1})+1\). Using these values in Eq. (10), we get
Thus, we have
Since \(E[E^{GR}(\mathbb {CDC}_k) ] = E^{GR}(\mathbb {CDC}_k)\), it follows that
Finally, solving the the recurrence relation by using the initial condition \(E(\mathbb {CDC}_2)= 7(4^{\gamma })+2(6^{\gamma })+2(9^{\gamma })\), we get
\(\square \)
We now focus on the unique cyclodecane chains \(\mathbb{C}\mathbb{F}_k\), \(\mathbb{C}\mathbb{G}_k\), \(\mathbb{C}\mathbb{H}_k\), \(\mathbb{C}\mathbb{I}_k\) and \(\mathbb{C}\mathbb{J}_k\) (see Fig. 5). These chains can be obtained from \(\mathbb {CDC}_k\) as special cases by taking the value of one of the probability \(\delta _i=1\) and the remaining probabilities 0 at each step, where \(i=1,2,\ldots , 5\). We use Theorems 1, 2, 3 and 4 to calculate the topological indices for these five specific chains.
Corollary 6
Let \(k\ge 2\), then we have
-
\(E^{ABC}(\mathbb{C}\mathbb{F}_k)=7.6973k-6.990\).
-
\(E^{ABS}(\mathbb{C}\mathbb{F}_k)=8.1319k-1.0352\).
-
\(E^{GA}(\mathbb{C}\mathbb{F}_k)=10.9596k-1\).
-
\(E^{R}(\mathbb{C}\mathbb{F}_k)=4.9832k-0.0001\).
-
\(E^{ABC}(\mathbb{C}\mathbb{G}_k)=ABC(\mathbb{C}\mathbb{H}_k)=ABC(\mathbb{C}\mathbb{I}_k)=ABC(\mathbb{C}\mathbb{J}_k)=7.7377k-7.0711\).
-
\(E^{ABS}(\mathbb{C}\mathbb{G}_k)=ABS(\mathbb{C}\mathbb{H}_k)=ABS(\mathbb{C}\mathbb{I}_k)=ABS(\mathbb{C}\mathbb{J}_k)=8.1575k-1.0864\).
-
\(E^{GA}(\mathbb{C}\mathbb{G}_k)=GA(\mathbb{C}\mathbb{H}_k)=GA(\mathbb{C}\mathbb{I}_k)=GA(\mathbb{C}\mathbb{J}_k)=10.9192k-0.9192\).
-
\(E^{R}(\mathbb{C}\mathbb{G}_k)=R(\mathbb{C}\mathbb{H}_k)=R(\mathbb{C}\mathbb{I}_k)=R(\mathbb{C}\mathbb{J}_k)=4.9663k+0.0337\).
Comparison between the expected values of topological descriptors
In this section we compare the expected values for the Randić, general Randić, atom-bound connectivity, atom-bound-sum connectivity and geometric-arithmetic indices for random cyclodecane chain having same probabilities. Tables 1, 2, 3, and 4 provides the numerical values of the expected values of these topological descriptors for different values of the probability function \(\delta _{1}\). It is easy to observe that the value of geometric-arithmetic index is always greater than the other topological descriptors in all the cases. The comparison of the expected values of these topological descriptors can be seen in Figs. 6 and 7. Now, we give an analytical proofs for the comparison of the expected values of the considered topological descriptors.
Theorem 6
If \(k\ge 2\), then \( E[ABS(\mathbb {CDC}_k)] > E[ABC(\mathbb {CDC}_k)]\).
Proof
The statement is true for \(k=2\). Now, we prove that the statement is true for \(k>2\). By using Theorems 2 and 3, we have
\(\square \)
Theorem 8
If \(k\ge 2\), then \(E[GA(\mathbb {CDC}_k)] > E[R(\mathbb {CDC}_k)]\).
Proof
The statement is true for \(k=2\). Now, we prove that the statement is true for \(k>2\). By using Theorem 1 and 4, we have
\(\square \)
Theorem 9
If \(k\ge 2\), then \(E[GA(\mathbb {CDC}_k)] > E[ABS(\mathbb {CDC}_k)]\)
Proof
The statement is true for \(k=2\). Now, we prove that the statement is true for \(k>2\). By using Theorem 1 and 3, we have
\(\square \)
Theorem 10
If \(k\ge 2\), then \(E[ABC(\mathbb {CDC}_k)] > E[R(\mathbb {CDC}_k)]\)
Proof
The statement is true for \(k=2\). Now, we prove that the statement is true for \(k>2\). By using Theorem 2 and 4, we have
\(\square \)
Corollary 11
If \(k\ge 2\), then \(E[GA(\mathbb {CDC}_k)]> E[ABS(\mathbb {CDC}_k)]> E[ABC(\mathbb {CDC}_k)] > E[R(\mathbb {CDC}_k)]\)
Proof
The result follows from Theorem 7, 8, 9 and 10. \(\square \)
Conclusion
In this research, the expected values of Randić index, general Randić index, atom-bound connectivity index, atom-bound-sum connectivity index and geometric-arithmetic index for a random cyclodecane chain are computed and analyzed. Along with numerical and graphical representations of these indices in random cyclodecane chains, we also provide analytical proofs for comparisons indicating that the geometric-arithmetic index has the highest expected value of the other three topological indices.
Data availability
All data generated or analysed during this study are included in this published article.
References
Liu, J. B. et al. Zagreb indices and multiplicative Zagreb indices of Eulerian graphs. Bull. Malays. Math. Sci. Soc. 42, 67–78. https://doi.org/10.1007/s40840-017-0463-2 (2019).
Liu, J. B., Zheng, Y. Q. & Peng, X. B. The statistical analysis for Sombor indices in a random polygonal chain networks. Discret. Appl. Math. 338, 218–233 (2023).
Liu, J. B. et al. Valency-based topological descriptors and structural property of the generalized Sierpinski networks. J. Stat. Phys. 177, 1131–1147. https://doi.org/10.1007/s10955-019-02412-2 (2019).
Zhang, G., Mushtaq, A., Aslam, A., Parveen, S. & Kanwal, S. Studying some networks using topological descriptors and multi-criterion decision making. Mol. Phys. 121, 16. https://doi.org/10.1080/00268976.2023.2222345 (2023).
Zhao, J., Liu, J. B. & Hayat, S. Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs. J. Appl. Math. Comput. 63, 1–27. https://doi.org/10.1007/s12190-019-01306-6 (2020).
Zhang, X., Aslam, A., Saeed, S., Razzaque, A. & Kanwal, S. Investigation for metallic crystals through chemical invariants, QSPR and fuzzy-TOPSIS. J. Biomol. Struct. Dyn.https://doi.org/10.1080/07391102.2023.2209656 (2023).
Yousaf, S., Bhatti, A. A. & Ali, A. A note on the modified Albertson index. (2019). arXiv preprint arXiv:1902.01809.
Gutman, I., Polansky, O. E., Gutman, I. & Polansky, O. E. Chemical graphs. Math. Concepts Organic Chem. 19-22 (1986).
Hui, W. et al. Ordering unicyclic connected graphs with girth \(g\ge 3\) having greatest \(SK\) indices. Symmetry 15(4), 871. https://doi.org/10.3390/sym15040871 (2023).
Usha, A., Shanmukha, M. C., Kumar, K. N. & Shilpa, K. C. Comparison of novel index with geometric-arithmetic and sum-connectivity indices. J. Math. Comput. Sci. 11(5), 5344–5360 (2021).
Yousaf, S., Bhatti, A. A. & Ali, A. On total irregularity index of trees with given number of segments or branching vertices. Chaos, Solitons Fractals 157, 111925 (2022).
Hosoya, H. Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bull. Chem. Soc. Japan 44(9), 2332–2339 (1971).
Balaban, A. T. Applications of graph theory in chemistry. J. Chem. Inf. Comput. Sci. 25(3), 334–343 (1985).
Gutman, I. & Trinajstić, N. Graph theory and molecular orbitals. Total \(\varphi \)-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 17(4), 535–538 (1972).
Estrada, E. & Uriarte, E. Recent advances on the role of topological indices in drug discovery research. Curr. Med. Chem. 8(13), 1573–1588 (2001).
Klein, D. J. Topological indices and related descriptors in QSAR and QSPR Edited by James Devillers and Alexandru T. Balaban. Gordon and Breach Science Publishers: Singapore. 1999. 811 pp. 90-5699-239-2. 198.00. J. Chem. Inf. Comput. Sci.42(6), 1507–1507 (2002).
Havare, O. C. Topological indices and QSPR modeling of some novel drugs used in the cancer treatment. Int. J. Quant. Chem. 121(24), 26813 (2021).
Randić, M. Characterization of molecular branching. J. Am. Chem. Soc. 97(23), 6609–6615 (1975).
Randić, M., Novic, M. & Plavsic, D. Solved and unsolved problems in structural chemistry (CRC Press, 2016).
Kier, L. B. & Hall, L. H. Molecular connectivity in chemistry and drug research (Academic Press, 1976).
Kier, L. B. & Hall, L. H. Molecular connectivity in structure-activity analysis (Wiley, 1986).
Hu, Y., Li, X. & Yuan, Y. Trees with minimum general Randic index. MATCH Commun. Math. Comput. Chem 52, 119–128 (2004).
Estrada, E., Torres, L., Rodriguez, L. & Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes (1998).
Estrada, E., Torres, L., Rodriguez, L. & Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes Indian. J. Chem. 37A, 849–855 (1998).
Estrada, E. Atom-bond connectivity and the energetic of branched alkanes. Chem. Phys. Lett. 463, 422–425 (2008).
Ali, A., Furtula, B., Redzepovic, I. & Gutman, I. Atom-bond sum-connectivity index. J. Math. Chem. 60(10), 2081–2093 (2022).
Vukicevic, D. & Furtula, B. Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem. 46, 1369–1376 (2009).
Ranjini, P. S., Lokesha, V. & Usha, A. Relation between phenylene and hexagonal squeeze using harmonic index. Int. J. Graph Theory 1(4), 116–121 (2013).
Huang, G., Kuang, M. & Deng, H. The expected values of Kirchhoff indices in the random polyphenyl and spiro chains. Ars Mathematica Contemporanea 9(2), 197–207 (2015).
Jahanbani, A. The expected values of the first Zagreb and Randic indices in random polyphenyl chains. Polycycl. Aromat. Compd. 42(4), 1851–1860 (2022).
Raza, Z. The expected values of arithmetic bond connectivity and geometric indices in random phenylene chains. Heliyon 6(7), e04479 (2020).
Raza, Z. The harmonic and second Zagreb indices in random polyphenyl and spiro chains. Polycycl. Aromat. Compd. 42(3), 671–680 (2022).
Raza, Z. The expected values of some indices in random phenylene chains. Eur. Phys. J. Plus 136(1), 1–15 (2021).
Ali, A., Raza, Z. & Bhatti, A. A. Extremal pentagonal chains with respect to degree-based topological indices. Can. J. Chem. 94(10), 870–876 (2016).
Gutmana, I. & Körtvélyesi, T. Wiener indices and molecular surfaces. Zeitschrift für Naturforschung A 50(7), 669–671 (1995).
Gutman, I., Kennedy, J. W. & Quintas, L. V. Wiener numbers of random benzenoid chains. Chem. Phys. Lett. 173(4), 403–408 (1990).
Yang, W. & Zhang, F. Wiener index in random polyphenyl chains. Match-Commun. Math. Comput. Chem. 68(1), 371 (2012).
Salamci, E., Ustabas, R., Çoruh, U., Yavuz, M. & Vázquez-López, E. M. Cyclooctane-1, 2, 5, 6-tetrayl tetraacetate. Acta Crystallogr. Sect. E Struct. Rep. Online 62(6), o2401–o2402 (2006).
Acknowledgements
This work was supported by Natural Science Research Foundation of Colleges and Universities of Anhui Province (KJ2021A0968) and Researchers Supporting Project Number (RSP2024R401), King Saud University, Riyadh, Saudi Arabia.
Author information
Authors and Affiliations
Contributions
All authors contributed equally to the work.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Chunsong, B., Naeem, A., Yousaf, S. et al. Exploring expected values of topological indices of random cyclodecane chains for chemical insights. Sci Rep 14, 10065 (2024). https://doi.org/10.1038/s41598-024-60484-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-024-60484-x
- Springer Nature Limited