Skip to main content

ORIGINAL RESEARCH article

Front. Chem. , 18 February 2025

Sec. Theoretical and Computational Chemistry

Volume 12 - 2024 | https://doi.org/10.3389/fchem.2024.1517892

Expected values of topological descriptors for possible kink chains of type 2⊤2

Ruxian Chen,Ruxian Chen1,2Asima Razzaque,
Asima Razzaque3,4*Maham KhalilMaham Khalil5Salma Kanwal
Salma Kanwal5*Saima Noor,Saima Noor3,4Robina Nazir,Robina Nazir3,4
  • 1School of Public and General Education, Guangzhou Civil Aviation College, Guangzhou, Gaudong, China
  • 2Institute of Computing Science and Technology, Guangzhou University, Guangzhou, China
  • 3Department of Basic Science, Preparatory Year, King Faisal University, Al-Ahsa, Saudi Arabia
  • 4Department of Mathematics, College of Science, King Faisal University, Al-Ahsa, Saudi Arabia
  • 5Department of Mathematics, Lahore College for Women University, Lahore, Pakistan

In this paper, we investigate square-hexagonal chains, a class of systems where the inner dual of a structure with a square-hexagon shape forms a path graph. The specific configuration of square and hexagonal polygons, and how they are concatenated, leads to different types of square-hexagonal chains. A square containing a vertex of degree 2 is classified as having a kink, and the resulting kink is referred to as a type 2 kink. This kink is further subdivided into three types: 12, 22, and 23. We focus on the kink chain of type 22 and compute various topological descriptors for this configuration. By deriving analytical expressions, we determine the maximizing and minimizing values of these descriptors. Additionally, we provide a comprehensive analysis of the expected values for these descriptors and offer a comparison of their behaviors through analytical, numerical, and graphical methods. These results offer insights into the structural properties and behavior of square-hexagonal chains, particularly in relation to the optimization of topological descriptors.

1 Preliminaries

Graph theory is a mathematical discipline that studies graphs, which are abstract structures used to model and analyze relationships between objects. A Graph ζ=(V(ζ),E(ζ)) is defined to be the collection of vertices (nodes) and edges (links or arcs) where V(ζ) and E(ζ) denotes set of vertices and edges respectively. The order of a graph, denoted as n=|V(ζ)| refers to the total number of vertices in the graph. The size of a graph, denoted as m=|E(ζ)| refers to the total number of edges in the graph. The degree of a vertex, denoted by deg(w) or dw, is the number of edges connected to that vertex. The distance d(w,x) between two vertices w,x is the length of the shortest path joining them. For basic definitions related to graph theory, we refer (Trinajstic, 1992).

In chemical graph theory, the numerical values assigned to a molecular graph, known as topological indices or molecular descriptors, are often used to correlate with chemical structures and their properties. In other words, topological indices refer to graph invariants or descriptors that have significant chemical relevance. These indices are based on the graphical representation of a molecule and can encode chemical information such as atom types and bond multiplicities. Topological indices are valuable for predicting specific chemical and physical properties of the underlying molecular structure, combining logical and mathematical principles to translate a molecule’s symbolic representation into a useable numerical form. Chemical graph theory, which merges the fields of chemistry and graph theory, uses graphs to represent chemical structures, providing insights into the physical and chemical characteristics of molecules.

The first degree based topological descriptor was introduced by Milan Randic in 1975 in his paper (Randic, 1975) “On characterization of molecular branching.” This index is referred to as Randic index and is defined as

Rζ=wxEζ1dw+dx.

The Randic index has been recognized as a valuable tool in drug design and has been widely used for this purpose in various studies (Randic, 1975).

The first and second Zagreb indices are the oldest degree based graph invariants introduced by Gutman and Trinajstic (Gutman and Trinajstic, 1972b) in 1972. They were later included among topological descriptors and are defined as

M1ζ=wxEζdw+dx.
M2ζ=wxEζdw×dx.

The first and second Zagreb indices were initially applied to branching problem (Gutman et al., 1975b). Later, they found applications in QSPR and QSAR studies (Balaban, 1979; Bonchev and Trinajsti, 2001; Devillers and Balaban, 1999).

The applicability of Zagreb indices motivated the researchers to define different variants of Zagreb indices. The Hyper Zagreb index was put forwarded by Shirdel et al. (Shirdel et al., 2013) in 2013 and is defined as

HZζ=wxEζdw+dx2.

Another variant of Zagreb indices namely, first and second redefined Zagreb indices were introduced by Ranjini et al. (Ranjini et al., 2013)

ReZ1ζ=wxEζdw+dxdwdx.
ReZ2ζ=wxEζdwdxdw+dx.

Motivated by the definitions of first and second Zagreb indices and their chemical applicability, V. Kulli (Kulli, 2017a) introduces the first and second Gourava indices. These topological indices are defined as

GO1ζ=wxEζdw+dx+dwdx.
GO2ζ=wxEζdw+dxdwdx.

The first and second Revan descriptors were introduced by V. Kulli (Kulli, 2017b) and are defined as

R1ζ=wxEζrw+rx
R2ζ=wxEζrwrx

where rw is defined as rw=Δζ+δζdw, where Δ and δ denotes the maximum and minimum degree among the vertices of ζ.

For more details on the importance of topological indices and their applications see (Noreen and Mahmood, 2018; Wei and Shiu, 2019; Raza, 2020; Wei et al., 2020; Fang et al., 2021; Alraqad et al., 2022; Zhang X. et al., 2023; Zhang Guoping et al., 2023; Hui et al., 2023a; Hui et al., 2023b; Huang et al., 2023). For results related to mathematical properties of the topological indices, we refere (Zhou, 2004; Zhao et al., 2016; Gao et al., 2017; Kulli, 2017c; Kulli, 2017e; Zhang et al., 2024; Govardhan et al., 2024; Prabhu et al., 2024a; Prabhu et al., 2024b).

2 Square-hexagonal system and kink chains

A square-hexagonal system, also known as a rectangular hexagonal system, is a connected geometric structure created by joining equal-sized squares and hexagons. This arrangement blends elements of square and hexagonal lattices, forming a distinctive repeating pattern that combines the characteristics of both shapes. The lattice points in this system create a regular and continuous design, where each polygon is linked to its neighbors. Two polygons are considered neighboring if they share a common edge, emphasizing the interconnected nature of this hybrid structure. This system is widely used in crystallography and materials science, particularly for analyzing the structures of materials with hexagonal crystal systems that exhibit square symmetry along specific crystallographic directions. It provides a geometric framework for understanding the arrangement of atoms, ions, or other structural components within such materials.

A square-hexagonal system is a two-dimensional lattice structure that combines square and hexagonal elements in a unified arrangement. In contrast, a square-hexagonal chain is a one-dimensional sequence where square and hexagonal configurations alternate along its length. While both concepts incorporate square and hexagonal features, they differ in their structure and intended applications. The structure of a square-hexagonal chain varies depending on the types of polygons used and how they are concatenated. A square-hexagonal chain composed of n polygons is denoted as Rn. If all the polygons in Rn are squares, it is referred to as a polyomino chain (Li et al., 2023). Similarly, if all the polygons are hexagons, Rn is called a hexagonal chain (Alraqad et al., 2022). However, when squares and hexagons alternate in the chain, Rn is specifically known as a phenylene chain. (as in (Raza, 2021; Shooshtari et al., 2022).

To derive key results, it is important to introduce certain terminologies related to square-hexagonal chains. In graph theory, a kink refers to a point in the graph where there is a sudden change in direction or slope. More precisely, a kink is a vertex whose degree is greater than the degrees of its neighboring vertices, resulting in a bend or angular deviation in the graph’s structure.

Kinks play a significant role in graph analysis, as they often highlight structural changes or key points within the graph. They can influence various graph properties and algorithms, including traversal methods, connectivity analysis, and the identification of critical nodes or hubs in networks. In network analysis, for instance, identifying kinks or high-degree vertices can reveal essential nodes that contribute significantly to the network’s connectivity or exert considerable influence. Moreover, the presence of kinks can affect processes like random walks, as high-degree vertices are more likely to attract repeated visits, thereby altering the overall dynamics of the system.

A polygon at one end of a chain, typically lacking a neighboring polygon on one of its sides, is referred to as a terminal polygon. In contrast, a polygon located within the chain, with neighboring polygons on both sides and not positioned at the chain’s ends, is termed a non-terminal polygon.

If the centers of two adjacent non-terminal polygons are not collinear, the polygon is described as kinked in the chain. There are two types of square-hexagonal kinks, denoted as 1 and 2 (Alraqad et al., 2022). In type 1, the kink is formed by a hexagon, while in type 2, square occurs as a kink. A non-terminal hexagon is considered kinked if and only if it contains two consecutive vertices of degree two. Similarly, a non-terminal square is considered kinked if and only if it has a single vertex with a degree of two. Following (Alraqad et al., 2022), we focus on square-hexagonal chains related to the kinks described below:

(1) Kinks1; A non-terminal hexagon that has exactly two vertices with a degree of two.

(2) Kinks21: A non-terminal square that is adjacent to two squares and has a vertex with a degree of two. (Figure 1A);

(3) Kinks22: A non-terminal square that is adjacent to a square and a hexagon and has a vertex of degree two. (Figure 1B);

(4) Kinks23: A non-terminal square adjacent to two hexagons and has a vertex of degree two. (Figure 1C);

Figure 1
www.frontiersin.org

Figure 1. Kinks of Type 12,22 and 32, (A) kink1, (B) kink2, (C) kink3.

In graph theory, the expected values of topological indices serve as statistical measures of a graph’s structural properties, capturing key characteristics such as connectivity, distances, and vertex degrees. These values are particularly valuable for analyzing and comparing random graphs, optimizing network designs, and predicting behaviors in fields like chemistry, biology, and social networks. Additionally, they enable the development of efficient algorithms for large-scale graph analysis by reducing the computational complexity of calculating indices across various graph models. Our work is motivated from our previous work on the kink chains introduced in (Chunsong et al., 2024). We considered three types of kink chains, 22, which are categorized as 212, 222, and 232, based on the specific way squares and hexagons are concatenated. For generality, we divided our analysis into two cases: odd and even numbered kink chains, addressing their orders, sizes, and corresponding vertex and edge partitions. Additionally, we calculated the topological indices defined earlier and demonstrated that the second Gourava topological index is a maximizing index, while the redefined first Zagreb index is a minimizing index in both cases. Now, we will determine the expected values of topological descriptors for the newly identified kink chains 212, 222, and 232. These kink chains are defined as;

Kink chains of. Type22

(a) Kinkchain212: A kink chain of type 22 in which no two adjacent vertices in the hexagons have a degree of 2, except at the terminal polygons. It is represented in Figure 2.

(b) Kinkchain222: A kink chain of type 22 in which there are exactly two adjacent vertices with a degree of 2 in the hexagons, excluding the terminal polygons. It is represented in Figure 3.

(c) Kinkchain232: A kink chain of type 22 in which there are three adjacent vertices with a degree of 2 in the hexagons, excluding the terminal polygons. It is represented in Figure 4.

Figure 2
www.frontiersin.org

Figure 2. Kinkchain212.

Figure 3
www.frontiersin.org

Figure 3. Kinkchain222.

Figure 4
www.frontiersin.org

Figure 4. Kinkchain232.

Observe that there is no edge between two adjacent vertices of degree 2, only one edge between two adjacent vertices of degree 2, and two edges between two adjacent vertices of degree two in kink chains 212, 222 and 232 respectively, except at terminal polygons. Let κ́ represents the number of kinks (squares forming a kink). It is observed that even-numbered kink chains result when two squares are joined at the terminal, while odd-numbered kink chains occur when a hexagon is attached at the terminal. Consequently, an odd-numbered chain corresponds to a square terminal, whereas an even-numbered chain corresponds to a hexagonal terminal. These cases are mathematically represented as κ́=2n1 for odd-numbered chains and κ́=2n for even-numbered chains, where nN. The order p of each kink chain is the same across these types and follows the formula p=6+4κ́. However, the size q of the chain differs: for κ́=2n1 (terminal square), q=11κ́+132, and for κ́=2n (terminal hexagon), q=11κ́+122.

2.1 Vertex and corresponding edge partitions of 212,222 and 232

Let Eij={e=wx;dw=i,dx=j} be the subclass of edge sets of 212, 222 and 232 then |Eij| depends on number of kinks κ́. Note that there are only (2,2), (2,3), (2,4), (3,4) and (4,4)-type of edges in each kink chain. Table 1 represents the edge partitions of each kink chain accordingly.

Table 1
www.frontiersin.org

Table 1. Edge partitions of 212, 222 and 232; nN.

Let Vi={wV(G)|dw=i} be the subclass of vertex sets of 212, 222 and 232. |Vi| depends on number of kinks κ́. There are only vertices of degree 2, 3 and 4 in each kink chain. Table 2 represents vertex partitions of chains in both cases. Note that the vertex partitions remain same for each kink chain.

Table 2
www.frontiersin.org

Table 2. Vertex partitions of 212, 222 and 232.

3 Topological descriptors of 212, 222 and 232

In this section, we will calculate some topological descriptors of 212, 222 and 232 using Tables 1, 2. Let p denotes the kink chain for kinks of type 22, where p varies from 1 to 3.

Lemma 1. For nN the first Revan index of Kink chain2p2 is given as;

R12p2=33κ́+49if p=1,2     ;for  κ́=2n1
R12p2=33κ́+48if p=1,2     ;for  κ́=2n
R12p2=32κ́+50          if p=3

Proof. For κ́=2n1

p=1

R1212=84+72κ́+2+62κ́+5κ́+1+4κ́12=33κ́+49

p=2

R1222=8κ́+72+73κ́+52+63κ́+12+53κ́+12+4κ́12=33κ́+49

p=3

R1232=8κ́+3+74+63κ́1+52+43κ́32=32κ́+50

For κ́=2n

p=1

R1212=86+72κ́+62κ́+5κ́+4κ́2=33κ́+48

p=2

R1222=8κ́+102+73κ́+22+63κ́+22+53κ́22+4κ́2=33κ́+48

p=3

R1232=8κ́+4+74+63κ́2+52+43κ́42=32κ́+50

Lemma 2. For nN the 2nd Revan, 1st and 2nd Redefined Zagreb, Hyper-Zagreb, 1st and 2nd Gourava descriptors of kink chains 212, 222 and 232 are are presented in Table 3;

Table 3
www.frontiersin.org

Table 3. Topological descriptors of 212, 222 and 232; nN.

4 Graphical representation of numerical values of topological descriptors of 212, 222 and 232

In this section, we compared the above calculated topological descriptors using graphical representation of 212, 222 and 232 at different values of κ́ for odd and even numbered kink chains. From the Figures 511 we conclude that GO2 descriptor of 212, 222 and 232 hits a highest value for both κ́=2n1 and κ́=2n. It follows that GO2 is a maximizing descriptor. On the other hand ReZ1 descriptor of 212, 222 and 232 reaches a lowest value for both κ́=2n1 and κ́=2n, thus ReZ1 is a minimizing descriptor.

Figure 5
www.frontiersin.org

Figure 5. Graphical representation of R1(212), R1(222) and R1(232). (A) For κ́=2n1, (B) For κ́=2n.

Figure 6
www.frontiersin.org

Figure 6. Graphical representation of R2(212), R2(222) and R2(232). (A) For κ́=2n1. (B) For κ́=2n.

Figure 7
www.frontiersin.org

Figure 7. Graphical representation of ReZ1(212), ReZ1(222) and ReZ1(232). (A) For κ́=2n1. (B) For κ́=2n.

Figure 8
www.frontiersin.org

Figure 8. Graphical representation of ReZ2(212), ReZ2(222) and ReZ2(232). (A) For κ́=2n1. (B) For κ́=2n

Figure 9
www.frontiersin.org

Figure 9. Graphical representation of HZ(212), HZ(222) and HZ(232). (A) For κ́=2n1. (B) For κ́=2n.

Figure 10
www.frontiersin.org

Figure 10. Graphical representation of GO1(212), GO1(222) and GO1(232). (A) For κ́=2n1. (B) For κ́=2n.

Figure 11
www.frontiersin.org

Figure 11. Graphical representation of GO2(212), GO2(222) and GO2(232). (A) For κ́=2n1. (B) For κ́=2n.

5 Expected values of topological descriptors of kink chains of type 22

As we know that there are only three possible kink chains (212, 222 and 232) or arrangements of type 22, holding the conditions to make kink at each step. The kink chains for κ́=1 and κ́=2 are shown in Figure 12. For κ́2, terminal polygons are attachable in three different ways, resulting in three types 212, 222 and 232. Considering that γ represents the probability of attaching terminal polygons in the first or second kind of arrangement, 12γ represents the probability of attaching the terminal polygon in the third type of arrangement. Possible arrangements of kink chains of type 22 are shown in Figure 12.

Figure 12
www.frontiersin.org

Figure 12. Possible arrangements of kink chains of type 22.

Let the Kinkchain22 with κ́ number of kinks and probability γ is represented by (2γ2)κ́. We compute Revan, Hyper-Zagreb, redefined Zagreb and Guorava descriptors of possible square-hexagonal kink chains (2γ2)κ́. Let |Eij|=βij denotes the number of edges for (2γ2)κ́ with end vertices of degree i and j respectively. There are only β22, β23, β24, β34 and β44-type of edges in (2γ2)κ́. Here Δ22 and δ22 are 4 and 2 implies that (Revan degrees) rs=4,3,2 for ds=2,3 and 4 respecively. From the definition, the topological descriptors can be expressed as

R12γ2κ́=8β222γ2κ́+7β232γ2κ́+6β242γ2κ́+5β342γ2κ́+4β442γ2κ́
R22γ2κ́=16β222γ2κ́+12β232γ2κ́+8β242γ2κ́+6β342γ2κ́+4β442γ2κ́
ReZ12γ2κ́=β222γ2κ́+56β232γ2κ́+34β242γ2κ́+712β342γ2κ́+12β442γ2κ́
ReZ22γ2κ́=β222γ2κ́+65β232γ2κ́+43β242γ2κ́+127β342γ2κ́+2β442γ2κ́
HZ2γ2κ́=16β222γ2κ́+25β232γ2κ́+36β242γ2κ́+49β342γ2κ́+64β442γ2κ́
GO12γ2κ́=8β222γ2κ́+11β232γ2κ́+14β242γ2κ́+19β342γ2κ́+24β442γ2κ́
GO22γ2κ́=16β222γ2κ́+30β232γ2κ́+48β242γ2κ́+84β342γ2κ́+128β442γ2κ́

As (2γ2)κ́ is a random kink chain, it follows R1(2γ2)κ́, R2(2γ2)κ́, ReZ1(2γ2)κ́, ReZ2(2γ2)κ́, HZ(2γ2)κ́, GO1(2γ2)κ́ and GO2(2γ2)κ́ are random variables. Let us denote by EnR1=E[R1(2γ2)κ́], EnR2=E[R2(2γ2)κ́], EnReZ1=E[ReZ1(2γ2)κ́], EnReZ2=E[ReZ2(2γ2)κ́], EnHZ=E[HZ(2γ2)κ́], EnGO1=E[GO1(2γ2)κ́] and EnGO2=E[GO2(2γ2)κ́] the expected values of these descriptors respectively.

Note that if κ́ is odd in kink chains 212, 222 and 232, then at (κ́1)th step, even numbered kink chains are formed, and at (κ́2)th step, odd numbered kink chains are formed. Similarly, if κ́ is even in kink chains 212, 222 and 232 at (κ́1)th step, odd numbered kink chains are obtained and at (κ́2)th step, even numbered kink chains are obtained again. So, we furthur divide our results in two possible stages;

(1) At (κ́1)th stage and (2) At (κ́2)th stage.

5.1 Results at (κ́1)th stage

The three possible constructions at (κ́1)th step are as follows:

1.(22)κ́1(212)κ́

2.(22)κ́1(222)κ́

3.(22)κ́1(232)κ́

For κ́=2n1 and κ́=2n; nN the change in edge partitions of (2γ2)κ́ for three possible constructions at (κ́1)th step are shown in Tables 4, 5 respectively.

Table 4
www.frontiersin.org

Table 4. Change in edge partitions of (2p2)κ́ at (k1)th stage for κ́=2n1; nN.

Table 5
www.frontiersin.org

Table 5. Change in edge partitions of (2p2)κ́ at (k1)th stage for κ́=2n; nN.

Theorem 5.1. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks.

(a) For κ́=2n1; nN

EnR1=κ́4γ+324γ+50

(b) For κ́=2n; nN

EnR1=32κ́+50

Proof. (a). When terminal polygon is a square.

For κ́=1n=1, E1=82, which is indeed true. Let κ́2, then using Table 4, we get

1. If (22)κ́1(212)κ́, then

R1212κ́=8β2222κ́12+7β2322κ́1+4+6β2422κ́1+2+5β3422κ́1+2+4β4422κ́1
R1212κ́=R122κ́1+34(5.1)

2. If (22)κ́1(222)κ́, then

R1222κ́=8β2222κ́11+7β2322κ́1+3+6β2422κ́1+1+5β3422κ́1+3+4β4422κ́1
R1222κ́=R122κ́1+34(5.2)

3. If (22)κ́1(232)κ́, then

R1232κ́=8β2222κ́1+7β2322κ́1+6β2422κ́1+4+5β3422κ́1+4β4422κ́1+2
R1232κ́=R122κ́1+32(5.3)

Thus, we have

Eκ́R1=γR1212κ́+γR1222κ́+12γR1232κ́

Using (6.1), (6.2) and (6.3), we get the following relation

Eκ́R1=γR122κ́1+34+γR122κ́1+34+12γR122κ́1+32
Eκ́R1=R122κ́1+4γ+32

Applying operator E on both sides, we get

EEκ́R1=Eκ́R1
Eκ́R1=Eκ́1R1+4γ+32

Using recursive relation upto κ́1 terms

Eκ́R1=Eκ́κ́1R1+κ́14γ+32=82+κ́14γ+32=κ́4γ+324γ+50

(b). When terminal polygon is a hexagon.

For n=1κ́=2, E2=114, which is indeed true. Let κ́2, then using Table 5, we get

1. If (22)κ́1(212)κ́, then

R1212κ́=8β2222κ́1+2+7β2322κ́1+6β2422κ́1+2+5β3422κ́1+4β4422κ́1+1
R1212κ́=R122κ́1+32(5.4)

2. If (22)κ́1(222)κ́, then

R1222κ́=8β2222κ́1+2+7β2322κ́1+6β2422κ́1+2+5β3422κ́1+4β4422κ́1+1
R1222κ́=R122κ́1+32(5.5)

3. If (22)κ́1(232)κ́, then

R1232κ́=6β2222κ́1+2+7β2322κ́1+6β2422κ́1+2+5β3422κ́1+4β4422κ́1+1
R1232κ́=R122κ́1+32(5.6)

Thus, we have

Eκ́R1=γR1212κ́+γR1222κ́+12γR1232κ́

Using (6.4), (6.5) and (6.6), we get the following relation

Eκ́R1=γR122κ́1+32+γR122κ́1+32+12γR122κ́1+32
Eκ́R1=R122κ́1+32

Applying operator E on both sides, we get

EEκ́R1=Eκ́R1
Eκ́R1=Eκ́1R1+32

Using recursive relation upto κ́2 terms

Eκ́R1=Eκ́κ́2R1+κ́232=114+κ́232=32κ́+50

which completes the proof.

Theorem 5.2. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks. Then

(a) For κ́=2n1; nN

Eκ́R2=κ́10γ+4010γ+100

(b) For κ́=2n; nN

Eκ́R2=52κ́+88

Proof. (a). For n=1κ́=1, E1=140, which is indeed true. Let κ́2, using Table 4, we get

1. If (22)n1(212)κ́, then

R2212κ́=16β2222κ́12+12β2322κ́1+4+8β2422κ́1+2+6β3422κ́1+2+4β4422κ́1
R2212κ́=R222κ́1+44(5.7)

2. If (22)κ́1(222)κ́, then

R2222κ́=16β2222κ́11+12β2322κ́1+3+8β2422κ́1+1+6β3422κ́1+3+4β4422κ́1
R2222κ́=R222κ́1+46(5.8)

3. If (22)κ́1(232)κ́, then

R2232κ́=16β2222κ́1+12β2322κ́1+8β2422κ́1+4+6β3422κ́1+4β4422κ́1+2
R2232κ́=R222κ́1+40(5.9)

Thus, we have

Eκ́R2=γR2212κ́+γR2222κ́+12γR2232κ́

Using (6.7), (6.8) and (6.9), we get the following relation

Eκ́R2=γR222κ́1+44+γR222κ́1+46+12γR222κ́1+40
Eκ́R2=R222κ́1+10γ+40
Eκ́R2=Eκ́1R2+10γ+40

Using recursive relation upto κ́1 terms

Eκ́R2=Eκ́κ́1R2+κ́110γ+40=140+κ́110γ+40=κ́10γ+4010γ+100

(b). For n=1κ́=2, E2=192, which is indeed true. Let κ́2, using Table 5, we get

1. If (22)κ́1(212)κ́, then

R2212κ́=16β2222κ́1+2+12β2322κ́1+8β2422κ́1+2+6β3422κ́1+4β4422κ́1+1
R2212κ́=R122κ́1+52(5.10)

2. If (22)κ́1(222)κ́, then

R2222κ́=16β2222κ́1+2+12β2322κ́1+8β2422κ́1+2+6β3422κ́1+4β4422κ́1+1
R2222κ́=R222κ́1+52(5.11)

3. If (22)κ́1(232)κ́, then

R2232κ́=16β2222κ́1+2+12β2322κ́1+8β2422κ́1+2+6β3422κ́1+4β4422κ́1+1
R2232κ́=R222κ́1+52(5.12)

Thus, we have

Eκ́R2=γR2212κ́+γR2+2222κ́12γR2232κ́

Using (6.10), (6.11) and (6.12), we get the following relation

Eκ́R2=γR222κ́1+52+γR222κ́1+52+12γR222κ́1+52
Eκ́R2=R222κ́1+52
Eκ́R2=Eκ́1R2+52

Using recursive relation upto κ́2 terms

Eκ́R2=Eκ́κ́2R2+κ́252=192+κ́252=52κ́+88

which completes the proof.

Theorem 5.3. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks, then

Eκ́ReZ1=4κ́+6

Proof. (a). For n=1κ́=1, E1=10, which is indeed true. Let κ́2, using Table 4, we get

1. If (22)κ́1(212)κ́, then

ReZ1212κ́=β2222κ́12+56β2322κ́1+4+34β2422κ́1+2+712β3422κ́1+2+12β4422κ́1
ReZ1212κ́=ReZ122κ́1+4(5.13)

2. If (22)κ́1(222)κ́, then

ReZ1222κ́=β2222κ́11+56β2322κ́1+3+34β2422κ́1+1+712β3422κ́1+3+12β4422κ́1
ReZ1222κ́=ReZ122κ́1+4(5.14)

3. If (22)κ́1(232)κ́, then

ReZ1232κ́=β2222κ́1+56β2322κ́1+34β2422κ́1+4+712β3422κ́1+12β4422κ́1+2
ReZ1232κ́=ReZ122κ́1+4(5.15)

Thus, we have

Eκ́ReZ1=γReZ1212κ́+γReZ1222κ́+12γReZ1232κ́

Using (6.13), (6.14) and (6.15), we get the following relation

Eκ́ReZ1=γReZ122κ́1+4+γReZ122κ́1+4+12γReZ122κ́1+4
Eκ́ReZ1=ReZ122κ́1+4

Applying operator E on both sides and E(Eκ́ReZ1)=Eκ́ReZ1

Eκ́ReZ1=Eκ́1ReZ1+4

Using recursive relation upto κ́1 terms

Eκ́ReZ1=Eκ́κ́1ReZ1+κ́14=10+κ́14=4κ́+6

(b). For n=1κ́=2, E2=14, which is indeed true. Let κ́2, using Table 5, we get

1. If (22)κ́1(212)κ́, then

ReZ1212κ́=β2222κ́1+2+56β2322κ́1+34β2422κ́1+2+712β3422κ́1+12β4422κ́1+1
ReZ1212κ́=ReZ122κ́1+4(5.16)

2. If (22)κ́1(222)κ́, then

ReZ1222κ́=β2222κ́1+56β2322κ́1+34β2422κ́1+4+712β3422κ́1+12β4422κ́1+2
ReZ1222κ́=ReZ122κ́1+4(5.17)

3. If (22)κ́1(232)κ́, then

ReZ1232κ́=β2222κ́1+56β2322κ́1+34β2422κ́1+4+712β3422κ́1+12β4422κ́1+2
ReZ1232κ́=ReZ122κ́1+4(5.18)

Thus, we have

Eκ́ReZ1=γReZ1212κ́+γReZ1222κ́+12γReZ1232κ́

Using (6.16), (6.17) and (6.18), we get the following relation

Eκ́ReZ1=γReZ122κ́1+4+γReZ122κ́1+4+12γReZ122κ́1+4
Eκ́ReZ1=ReZ122κ́1+4
Eκ́ReZ1=Eκ́1ReZ1+4

Using recursive relation upto κ́2 terms

Eκ́ReZ1=Eκ́κ́2ReZ1+κ́24=14+κ́24=4κ́+6

which completes the proof.

Theorem 5.4. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks.

(a) For κ́=2n1; nN

Eκ́ReZ2=κ́28373105γ+73105γ+584105

(b) For κ́=2n; nN

Eκ́ReZ2=203κ́+28835

Proof. (a). For n=1κ́=1, E1=1564105, which is indeed true. Let κ́2, using Table 4, we get

1. If (22)κ́1(212)κ́, then

ReZ2212κ́=β2222κ́12+65β2322κ́1+4+43β2422κ́1+2+127β3422κ́1+2+2β4422κ́1
ReZ2212κ́=ReZ222κ́1+934105(5.19)

2. If (22)κ́1(222)κ́, then

ReZ2222κ́=β2222κ́11+65β2322κ́1+3+43β2422κ́1+1+127β3422κ́1+3+2β4422κ́1
ReZ2222κ́=ReZ222κ́1+953105(5.20)

3. If (22)κ́1(232)κ́, then

ReZ2232κ́=β2222κ́1+65β2322κ́1+43β2422κ́1+4+127β3422κ́1+2β4422κ́1+2
ReZ2232κ́=ReZ222κ́1+283(5.21)

Thus, we have

Eκ́ReZ2=γReZ2212κ́+γReZ2222κ́+12γReZ2232κ́

Using (6.19), (6.20) and (6.21), we get the following relation

Eκ́ReZ2=γReZ222κ́1+934105+γReZ222κ́1+953105+12γReZ222κ́1+283
Eκ́ReZ2=ReZ222κ́173105γ+283
Eκ́ReZ2=Eκ́1ReZ273105γ+283

Using recursive relation upto κ́1 terms

Eκ́ReZ2=Eκ́κ́1ReZ2+κ́128373105γ=1564105+κ́128373105γ=κ́28373105γ+73105γ+584105

(b). For n=1κ́=2, E2=2264105, which is indeed true. Let κ́2, using Table 5, we get

1. If (22)κ́1(212)κ́, then

ReZ2212κ́=β2222κ́1+2+65β2322κ́1+43β2422κ́1+2+127β3422κ́1+2β4422κ́1+1
ReZ2212κ́=ReZ222κ́1+203(5.22)

2. If (22)κ́1(222)κ́, then

ReZ2222κ́=β2222κ́1+65β2322κ́1+43β2422κ́1+4+127β3422κ́1+2β4422κ́1+2
ReZ2222κ́=ReZ222κ́1+203(5.23)

3. If (22)κ́1(232)κ́, then

ReZ2232κ́=β2222κ́1+65β2322κ́1+43β2422κ́1+4+127β3422κ́1+2β4422κ́1+2
ReZ2232κ́=ReZ222κ́1+203(5.24)

Thus, we have

Eκ́ReZ2=γReZ2212κ́+γReZ2222κ́+12γReZ2232κ́

Using (6.22), (6.23) and (6.24), we get the following relation

Eκ́ReZ2=γReZ222κ́1+203+γReZ222κ́1+203+12γReZ222κ́1+203
Eκ́ReZ2=ReZ222κ́1+203

Applying operator E on both sides and E(Eκ́ReZ2)=Eκ́ReZ2

Eκ́ReZ2=Eκ́1ReZ2+203

Using recursive relation upto κ́2 terms

Eκ́ReZ2=Eκ́κ́2ReZ2+κ́2203=2264105+κ́2203=203κ́+28835

which completes the proof.

Theorem 5.5. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks.

(a) For κ́=2n1; nN

Eκ́HZ=κ́27264γ+64γ+62

(b) For κ́=2n; nN

Eκ́HZ=168κ́+166

Proof. (a). For n=1κ́=1, E1=334, which is indeed true. Let κ́2, using Table 4, we get

1. If (22)κ́1(212)κ́, then

HZ212κ́=16β2222κ́12+25β2322κ́1+4+36β2422κ́1+2+49β3422κ́1+2+64β4422κ́1
HZ212κ́=HZ22κ́1+238(5.25)

2. If (22)κ́1(222)κ́, then

HZ222κ́=16β2222κ́11+25β2322κ́1+3+36β2422κ́1+1+49β3422κ́1+3+64β4422κ́1
HZ222κ́=HZ22κ́1+242(5.26)

3. If (22)κ́1(232)κ́, then

HZ232κ́=16β2222κ́1+25β2322κ́1+36β2422κ́1+4+49β3422κ́1+64β4422κ́1+2
HZ232κ́=HZ22κ́1+272(5.27)

Thus, we have

Eκ́HZ=γHZ212κ́+γHZ222κ́+12γHZ232κ́

Using (6.25), (6.26) and (6.27), we get the following relation

Eκ́HZ=γHZ22κ́1+238+γHZ22κ́1+242+12γHZ22κ́1+272
Eκ́HZ=HZ22κ́164γ+272

Applying operator E on both sides and E(Eκ́HZ)=Eκ́HZ

Eκ́HZ=Eκ́1HZ64γ+272

Using recursive relation upto κ́1 terms

Eκ́HZ=Eκ́κ́1HZ+κ́127264γ=334+κ́127264γ=κ́27264γ+64γ+62

(b). For n=1κ́=2, E2=502, which is indeed true. Let κ́2, using Table 5, we get

1. If (22)κ́1(212)κ́, then

HZ212κ́=16β2222κ́1+2+25β2322κ́1+36β2422κ́1+2+49β3422κ́1+64β4422κ́1+1
HZ212κ́=HZ22κ́1+168(5.28)

2. If (22)κ́1(222)κ́, then

HZ222κ́=16β2222κ́1+25β2322κ́1+36β2422κ́1+4+49β3422κ́1+64β4422κ́1+2
HZ222κ́=HZ22κ́1+168(5.29)

3. If (22)κ́1(232)κ́, then

HZ232κ́=16β2222κ́1+2+25β2322κ́1+36β2422κ́1+2+49β3422κ́1+64β4422κ́1+1
HZ232κ́=HZ22κ́1+168(5.30)

Thus, we have

Eκ́HZ=γHZ212κ́+γHZ222κ́+12γHZ232κ́

Using (6.28), (6.29) and (6.30), we get the following relation

Eκ́HZ=γHZ122κ́1+168+γHZ22κ́1+168+12γHZ22κ́1+168
Eκ́HZ=HZ22κ́1+168
Eκ́HZ=Eκ́1HZ+168

Using recursive relation upto κ́2 terms

=Eκ́κ́2HZ+κ́2168=502+κ́2168=168κ́+166

which completes the proof.

Theorem 5.6. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks.

(a) For κ́=2n1; nN

Eκ́GO1=κ́10418γ+18γ+38

(b) For κ́=2n; nN

Eκ́GO1=68κ́+74

Proof. (a). For n=1κ́=1, E1=142, which is indeed true. Let κ́2, using Table 4, we get

1. If (22)κ́1(212)κ́, then

GO1212κ́=8β2222κ́12+11β2322κ́1+4+14β2422κ́1+2+19β3422κ́1+2+24β4422κ́1
GO1212κ́=GO122κ́1+94(5.31)

2. If (22)κ́1(222)κ́, then

GO1222κ́=8β2222κ́11+11β2322κ́1+3+14β2422κ́1+1+19β3422κ́1+3+24β4422κ́1
GO1222κ́=GO122κ́1+96(5.32)

3. If (22)κ́1(232)κ́, then

GO1232κ́=8β2222κ́1+11β2322κ́1+14β2422κ́1+4+19β3422κ́1+24β4422κ́1+2
GO1232κ́=GO122κ́1+104(5.33)

Thus, we have

Eκ́GO1=γGO1212κ́+γGO1222κ́+12γGO1232κ́

Using (6.31), (6.32) and (6.33), we get the following relation

Eκ́GO1=γGO122κ́1+94+γGO122κ́1+96+12γGO122κ́1+104
Eκ́GO1=GO122κ́118γ+104

Applying operator E on both sides and E(Eκ́GO1)=Eκ́GO1

Eκ́GO1=Eκ́1GO118γ+104

Using recursive relation upto κ́1 terms

Eκ́GO1=Eκ́κ́1GO1+κ́118γ+104=142+κ́110418γ=κ́10418γ+18γ+38

(b). For n=1κ́=2, E2=210, which is indeed true. Let κ́2, using Table 5, we get

1. If (22)κ́1(212)κ́, then

GO1212κ́=8β2222κ́1+2+11β2322κ́1+14β2422κ́1+2+19β3422κ́1+24β4422κ́1+1
GO1212κ́=GO122κ́1+68(5.34)

2. If (22)κ́1(222)κ́, then

GO1222κ́=8β2222κ́1+2+11β2322κ́1+14β2422κ́1+2+19β3422κ́1+24β4422κ́1+1
GO1222κ́=GO122κ́1+68(5.35)

3. If (22)κ́1(232)κ́, then

GO1232κ́=8β2222κ́1+2+11β2322κ́1+14β2422κ́1+2+19β3422κ́1+24β4422κ́1+1
GO1232κ́=GO122κ́1+68(5.36)

Thus, we have

Eκ́GO1=γGO1212κ́+γGO1222κ́+12γGO1232κ́

Using (6.34), (6.35) and (6.36), we get the following relation

Eκ́GO1=γGO122κ́1+68+γGO122κ́1+68+12γGO122κ́1+68
Eκ́GO1=GO122κ́1+68
Eκ́GO1=Eκ́1GO1+68

Using recursive relation upto κ́2 terms

Eκ́GO1=Eκ́κ́2GO1+κ́268=210+κ́268=68κ́+74

which completes the proof.

Theorem 5.7. Let 22 be a square-hexagonal kink chain and κ́ be the number of kinks.

(a) For κ́=2n1; nN

Eκ́GO2=κ́448170γ+170γ

(b) For κ́=2n; nN

Eκ́GO2=256κ́+192

Proof. (a). For n=1κ́=1, E1=448, which is indeed true. Let κ́2, using Table 4, we get

1. If (22)κ́1(212)κ́, then

GO2212κ́=16β2222κ́12+30β2322κ́1+4+48β2422κ́1+2+84β3422κ́1+2+128β4422κ́1
GO2212κ́=GO222κ́1+352(5.37)

2. If (22)κ́1(222)κ́, then

GO2222κ́=16β2222κ́11+30β2322κ́1+3+48β2422κ́1+1+84β3422κ́1+3+128β4422κ́1
GO2222κ́=GO222κ́1+374(5.38)

3. If (22)κ́1(232)κ́, then

GO2232κ́=16β2222κ́1+30β2322κ́1+48β2422κ́1+4+84β3422κ́1+128β4422κ́1+2
GO2232κ́=GO222κ́1+448(5.39)

Thus, we have

Eκ́GO2=γGO2212κ́+γGO2222κ́+12γGO2232κ́

Using (6.37), (6.38) and (6.39), we get the following relation

Eκ́GO2=γGO222κ́1+352+γGO222κ́1+374+12γGO222κ́1+448
Eκ́GO2=GO222κ́1170γ+448

Applying operator E on both sides and E(Eκ́GO2)=Eκ́GO2

Eκ́GO2=Eκ́1GO2170γ+448

Using recursive relation upto κ́1 terms

Eκ́GO2=Eκ́κ́1GO2+κ́1170γ+448=448+κ́1448170γ=κ́448170γ+170γ

(b). For n=1κ́=2, E2=704, which is indeed true. Let κ́2, using Table 5, we get

1. If (22)κ́1(212)κ́, then

GO2212κ́=16β2222κ́1+2+30β2322κ́1+48β2422κ́1+2+84β3422κ́1+128β4422κ́1+1
GO2212κ́=GO222κ́1+256(5.40)

2. If (22)κ́1(222)κ́, then

GO2222κ́=16β2222κ́1+2+30β2322κ́1+48β2422κ́1+2+84β3422κ́1+128β4422κ́1+1
GO2222κ́=GO222κ́1+256(5.41)

3. If (22)κ́1(232)κ́, then

GO2232κ́=16β2222κ́1+2+30β2322κ́1+48β2422κ́1+2+84β3422κ́1+128β4422κ́1+1
GO2232κ́=GO222κ́1+256(5.42)

Thus, we have

Eκ́GO2=γGO2212κ́+γGO2222κ́+12γGO2232κ́

Using (6.40), (6.41) and (6.42), we get the following relation

Eκ́GO2=γGO222κ́1+256+γGO222κ́1+256+12γGO222κ́1+256
Eκ́GO2=GO222κ́1+256
Eκ́GO2=Eκ́1GO2+256

Using recursive relation upto κ́2 terms

Eκ́GO2=Eκ́κ́2GO2+κ́2256=704+κ́2256=256κ́+192

which completes the proof.

The expected values ER1κ́, ERe2κ́, EHZκ́, EReZ2κ́, EGO1κ́ and EGO2κ́ descriptors for κ́=2n1; nN depend on γ, but the EReZ1κ́ is independent of γ for both cases. As for the sake of generality we have taken expectations in odd and even cases. Therefore, at (κ́1)th stage the sum of expected values for κ́=2n1 and κ́=2n of a certain topological descriptor of three kink chains is equal to the sum of the average value of topological descriptor of three kink chain for κ́=2n1 and κ́=2n with a constant factor. As expectation of constant is zero, so our results are true. The values of R1, R2, HZ, ReZ2, GO1 and GO2 descriptors can be computed by using γ=13 in the above proved theorems.

Corollary 1. Let κ́=2n1; nN then at (κ́1) stage;

R1=1003(κ́1)+82

R2=1303(κ́1)+140

ReZ2=2867315(κ́1)+1564105

HZ=7523(κ́1)+334

GO1=98(κ́1)+142

GO2=11743(κ́1)+448

Remark 1. The value of ReZ1 descriptor at (κ́1)th stage for κ́=2n1 and κ́=2n; nN is equal and independent of γ, i.e;

ReZ1(2p2)=4κ́+6; p=1, 2 and 3

It is observed that the expected values ER1κ́, EReZ1κ́, ERe2κ́, EHZκ́, EReZ2κ́, EGO1κ́ and EGO2κ́ for κ́=2n; nN are independent of γ and depends only on κ́.

Remark 2. Let κ́=2n,; nN then at (κ́1) stage,

R1=32κ́+50

R2=52κ́+88

ReZ2=203κ́+28835

HZ=168κ́+166

GO1=68κ́+74

GO2=256κ́+192

5.2 Analytical expressions at (k1)th stage

Now we analytically prove that at (κ́1)th stage, for any value of γ and κ́, the 2nd Gourava descriptor is always greater than the remaining six descriptors, namely, (1st and 2nd) Revan descriptors, (1st and 2nd), Zagreb descriptors, Hyper-Zagreb descriptor and 1st Gourava descriptor for κ́=2n1 and κ́=2n. All the expressions holds for γ=13 and for all κ́N.

Corollary 2. For κ́=2n1 and κ́=2n; nN, we have

EGO22γ2κ́>EHZ2γ2κ́

Proof. For κ́=2n1

EGO22γ2κ́EHZ2γ2κ́=κ́448170γ+170γκ́27264γ+64γ+62=106γ1κ́+2224κ́31>0

which holds for γ=13 and for all κ́N, so we have

EGO22γ2κ́>EHZ2γ2κ́

For κ́=2n

EGO22γ2κ́EHZ2γ2κ́=256κ́+192168κ́+166=88κ́+26>0

which holds for all κ́N, so we have

EGO22γ2κ́>EHZ2γ2κ́

Corollary 3. For κ́=2n1 and κ́=2n; κ́N, we have

EHZ2γ2κ́>EGO12γ2κ́

Proof. For κ́=2n1

EHZ2γ2κ́EGO12γ2κ́=κ́27264γ+64γ+62κ́10418γ+18γ+38=46γ1κ́+2136κ́19>0

which holds for γ=13 and for all κ́N, so we have

EHZ2γ2κ́>EGO12γ2κ́

For κ́=2n

EHZ2γ2κ́EGO12γ2κ́=168κ́+16668κ́+74=100κ́+92>0

which holds for all κ́N, so we have

EHZ2γ2κ́>EGO12γ2κ́

Corollary 4. For κ́=2n1 and κ́=2n; κ́N, we have

EGO12γ2κ́>ER22γ2κ́

Proof. For κ́=2n1

EGO12γ2κ́ER22γ2κ́=κ́10418γ+18γ+38κ́10γ+4010γ+100=28γ1κ́+232κ́31>0

which holds for γ=13 and for all κ́N, so we have

EGO12γ2κ́>ER22γ2κ́

For κ́=2n

EGO12γ2κ́ER22γ2κ́=68κ́+7452κ́+88=16κ́14>0

which holds for all κ́N, so we have

EGO12γ2κ́>ER22γ2κ́

Corollary 5. For κ́=2n1 and κ́=2n; κ́N, we have

ER22γ2κ́>ER12γ2κ́

Proof. For κ́=2n1

ER22γ2κ́ER12γ2κ́=κ́10γ+4010γ+100κ́4γ+324γ+50=6γκ́1+24κ́25>0

which holds for γ=13 and for all κ́N, so we have

ER22γ2κ́>ER12γ2κ́

For κ́=2n

ER22γ2κ́ER12γ2κ́=52κ́+8832κ́+50=20κ́+38>0

which holds for all κ́N, so we have

ER22γ2κ́>ER12γ2κ́

Corollary 6. For κ́=2n1 and κ́=2n; κ́N, we have

ER12γ2κ́>EReZ22γ2κ́

Proof. For κ́=2n1

ER12γ2κ́EReZ22γ2κ́=κ́4γ+324γ+50κ́28373105γ+584105+73105γ=493105γκ́1+2334κ́233335>0

which holds for γ=13 and for all κ́N, so we have

ER12γ2κ́>EReZ22γ2κ́

For κ́=2n

ER12γ2κ́EReZ22γ2κ́=32κ́+50203κ́+28835=763κ́+146235>0

which holds for all κ́N, so we have

ER12γ2κ́>EReZ22γ2κ́

Corollary 7. For κ́=2n1 and κ́=2n; κ́N, we have

EReZ22γ2κ́>EReZ12γ2κ́

Proof. For κ́=2n1

EReZ22γ2κ́EReZ12γ2κ́=κ́28373105γ+584105+73105γ4κ́+6=73105γ1κ́+238κ́2335>0

which holds for γ=13 and for all κ́N, so we have

EReZ22γ2κ́>EReZ12γ2κ́

For κ́=2n

EReZ22γ2κ́EReZ12γ2κ́=203κ́+288354κ́+6=83κ́+7835>0

which holds for all κ́N, so we have

EReZ22γ2κ́>EReZ12γ2κ́

From the above analytical expressions we get;

Corollary 8.

EGO22γ2κ́>EHZ2γ2κ́>EGO12γ2κ́>ER22γ2κ́>ER12γ2κ́>EReZ22γ2κ́>EReZ12γ2κ́

5.3 A comparison of expected values of topological descriptors at (κ́1)th stage

Table 6, 7 depict the expected values of Revan descriptors, Zagreb descriptors, Hyper-Zagreb descriptor and Gourava descriptors for γ=13 and κ́=2n1 and κ́=2n respectively. Observe that the value of expectation of 2nd Gourava descriptor is always greater than the remaining six descriptors in both cases.

Table 6
www.frontiersin.org

Table 6. Expected values for topological descriptors at (κ́1)th stage for γ=13 and κ́=2n1.

Table 7
www.frontiersin.org

Table 7. Expected values for topological descriptors at (κ́1)th stage for γ=13 and κ́=2n.

5.4 Graphical representation of expected values of topological descriptors at (κ́1)th stage

The Figures 1316 shows that expectation of 2nd Gourava descriptor attains maximum value and of 1st redefined Zagreb descriptor attains minimum value at (κ́1)th stage for both the cases.

Figure 13
www.frontiersin.org

Figure 13. Graphical representation of expectations of R1, R2, ReZ1 and ReZ2 at (κ́1)th stage for κ́=2n1.

Figure 14
www.frontiersin.org

Figure 14. Graphical representation of expectations of R1, R2, ReZ1 and ReZ2 at (κ́1)th stage for κ́=2n.

Figure 15
www.frontiersin.org

Figure 15. Graphical representation of expectations of HZ, GO1 and GO2 at (κ́1)th stage for κ́=2n1.

Figure 16
www.frontiersin.org

Figure 16. Graphical representation of expectations of HZ, GO1 and GO2 at (κ́1)th stage for κ́=2n.

6 Applications

Kinks, which denote abrupt changes in the direction of edges within a graph, hold notable applications across diverse fields. In circuit design, minimizing kinks optimizes wire lengths and enhances efficiency. Network routing benefits from understanding kinks, as they affect data flow and network performance. Transportation planners use kink analysis to streamline traffic, plan intersections, and design efficient road networks. Graph drawing algorithms consider kinks for aesthetically pleasing and comprehensible visual representations. Lastly, in various applications where visual appeal matters, reducing kinks enhances the attractiveness and clarity of graph representations.

Studying the interforce interactions and scattering of (Lima and Almeida, 2023) kink-antikink-like solutions in a two-dimensional dilaton gravity model has practical implications in fields like material science, nonlinear optics, and cosmology. It aids in understanding energy distribution, stability dynamics, and defect interactions, which are crucial for developing advanced technologies and predicting behaviors in complex physical systems. The in situ (Zhu et al., 2023) investigations have revealed the important role for the kinks. During the growth, the creation of kinks determines the growth rate. Besides, when two domains coalesce, the shape of the final flake is affected by kinks.

In computer graphics, square and hexagonal grids are frequently used to create images or simulations. Kinks in these grids can represent corners or junctions in a digital image. Hexagonal kinks are essential in the study of tessellation and pattern generation. The expected value of random graphs plays a crucial role in graph theory as well. It helps analyze and predict various graph properties in probabilistic settings. By studying expected values in graph theory, we gain a balanced understanding of how certain structures behave under randomness, which informs both theory and practical applications. Expected values are used to calculate the probability that a random graph is connected. It can be employed to estimate the likelihood that two randomly generated graphs are isomorphic. This is valuable in assessing the structural similarity between graphs.

7 Conclusion

In this research work, we determined R1, R2, ReZ1, ReZ2, HZ, GO1 and GO2 descriptors for the graphical structures of kink chains of type 22 named as 212, 222 and 232. We infered that GO2 is a maximizing, while ReZ1 is a minimizing descriptor of 212, 222 and 232,for both, odd and even case. Further we determined expected values of topological descriptors of (2γ2)k at (κ́1)th stage. We analyzed that value of ReZ1 descriptor of 212, 222 and 232 and EkReZ1 is same and independent of γ at (κ́1)th stage. We made numerical comparison for these expected values at (κ́1)th stage and conclude that expected value, EkGO2 is greater while expected value, EkReZ1 is smaller among other expectations EkR1, EkR2, and EkReZ2, EkHZ, and EkGO1 at (κ́1)th stage. Also, we gave exact analytical expressions of this comparison at (κ́1)th stage which agree with numerical values of comparisons. Results at (κ́2)th stage will be computed in the next article.

Data availability statement

The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding authors.

Author contributions

RC: Conceptualization, Investigation, Methodology, Validation, Writing–review and editing. AR: Conceptualization, Investigation, Methodology, Validation, Writing–review and editing. MK: Formal Analysis, Investigation, Validation, Writing–original draft. SK: Conceptualization, Methodology, Validation, Writing–original draft. SN: Conceptualization, Formal Analysis, Investigation, Validation, Writing–review and editing. RN: Conceptualization, Formal Analysis, Investigation, Validation, Writing–review and editing.

Funding

The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This work was supported by National Natural Science Foundation of China (No. 62407011, 62172116) and the Guangzhou Academician and Expert Workstation (No. 2024-D003) and Deanship of the Science Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia (KFU242800).

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Generative AI statement

The author(s) declare that no Generative AI was used in the creation of this manuscript.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

References

Alraqad, T. A., Saber, H., Ali, A., and Mazorodze, J. P. (2022). On-bond incident degree indices of square-hexagonal chains. J. Math. 2022. doi:10.1155/2022/1864828

CrossRef Full Text | Google Scholar

Balaban, A. T. (1979). Theor. Chim. Acta 53, 355375. doi:10.1007/BF00555695

CrossRef Full Text | Google Scholar

Bonchev, D., and Trinajsti, N. (2001). Sar. QSAR Environ. Res. 12, 213236. doi:10.1080/10629360108035379

CrossRef Full Text | Google Scholar

Chunsong, B., Khalil, M., Razzaque, A., Kanwal, S., Nazir, R., and Noor, S. (2024). Exploring structural variations and topological descriptors of square-hexagonal kink chains of type T2, 2 in engineering applications. Adv. Mech. Eng. 16 (10), 16878132241290418. doi:10.1177/16878132241290418

CrossRef Full Text | Google Scholar

J. Devillers, and A. T. Balaban (1999). Topological indices and related descriptors in QSAR and QSPR (Amsterdam: Gordon & Breach).

Fang, X., You, L., and Liu, H. (2021). The expected values of Sombor indices in random hexagonal chains, phenylene chains and Sombor indices of some chemical graphs. Int. J. Quantum Chem. 121 (17), e26740. doi:10.1002/qua.26740

CrossRef Full Text | Google Scholar

Gao, W., Jamil, M. K., and Farahani, M. R. (2017). The hyper-Zagreb index and some graph operations. J. Appl. Math. Comput. 54, 263–275. doi:10.1007/s12190-016-1008-9

CrossRef Full Text | Google Scholar

Govardhan, S., Roy, S., Prabhu, S., and Arulperumjothi, M. (2024). Topological characterization of cove-edged graphene nanoribbons with applications to NMR spectroscopies. J. Mol. Struct. 1303, 137492. doi:10.1016/j.molstruc.2024.137492

CrossRef Full Text | Google Scholar

Gutman, I., Rucic, B., Trinajstic, N., and Wilcox, C. F. (1975b). J. Chem. Phys. 62 (9), 3399–3405. doi:10.1063/1.430994

CrossRef Full Text | Google Scholar

Gutman, I., and Trinajstic, N. (1972b). Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 17, 535–538. doi:10.1016/0009-2614(72)85099-1

CrossRef Full Text | Google Scholar

Huang, R.-R., Aftab, S., Noureen, S., and Aslam, A. (2023). Analysis of porphyrin, PETIM and zinc porphyrin dendrimers by atom-bond sum-connectivity index for drug delivery. Mol. Phys. 121, 15. doi:10.1080/00268976.2023.2214073

CrossRef Full Text | Google Scholar

Hui, Z., Rauf, A., Naeem, M., Aslam, A., and Vania Saleem, A. (2023b). Quality testing analysis of Ve-degree based entropies by using benzene derivatives, 121, 17. e27146.

Google Scholar

Hui, Z.-H, Yousaf, S., Aslam, A., Ahsan Binyamin, M., and Kanwal, S. (2023a). On expected values of some degree based topological descriptors of random Phenylene chains. Molecular 121. doi:10.1080/00268976.2023.2225648

CrossRef Full Text | Google Scholar

Kulli, V. R. (2017a). On Hyper-Gourava indices and coindices. Int. J. Math. Archive 8 (12), 116–120.

Google Scholar

Kulli, V. R. (2017b). Revan indices of oxide and honeycomb networks. Int. J. Math. its Appl. 5 (4-E), 663–667.

Google Scholar

Kulli, V. R. (2017c). The Gourava indices and coindices of graphs. Ann. Pure Appl. Math. 14 (1), 33–38. doi:10.22457/apam.v14n1a4

CrossRef Full Text | Google Scholar

Kulli, V. R. (2017e). Revan indices of oxide and honeycomb networks. Int. J. Math. its Appl. 55, 7.

Google Scholar

Li, M., Asif, M., Ali, H., Mahmood, F., and Ali, P. (2023). Kirchhoff index and additive Kirchhoff index based on multiplicative degree for a random polyomino chain. Symmetry 15 (3), 718. doi:10.3390/sym15030718

CrossRef Full Text | Google Scholar

Lima, F. C. E., and Almeida, C. A. S. (2023). Aspects of kink-like structures in 2D dilaton gravity. Fortschritte Phys. 71 (12), 2300051. doi:10.1002/prop.202300051

CrossRef Full Text | Google Scholar

Noreen, S., and Mahmood, A. (2018). Zagreb polynomials and redefined Zagreb indices for the line graph of carbon nanocones. Open J. Math. analysis 2 (1), 66–73. doi:10.30538/psrp-oma2018.0012

CrossRef Full Text | Google Scholar

Prabhu, S., Arulperumjothi, M., Manimozhi, V., and Balasubramanian, K. (2024b). Topological characterizations on hexagonal and rectangular tessellations of antikekulenes and its computed spectral, nuclear magnetic resonance and electron spin resonance characterizations. Int. J. Quantum Chem. 124 (7), e27365. doi:10.1002/qua.27365

CrossRef Full Text | Google Scholar

Prabhu, S., Murugan, G., Imran, M., Arockiaraj, M., Alam, M. M., and Ghani, M. U. (2024a). Several distance and degree-based molecular structural attributes of cove-edged graphene nanoribbons. Heliyon 10 (15), e34944. doi:10.1016/j.heliyon.2024.e34944

PubMed Abstract | CrossRef Full Text | Google Scholar

Randic, M. (1975). Characterization of molecular branching. J. Am. Chem. Soc. 97, 6609–6615. doi:10.1021/ja00856a001

CrossRef Full Text | Google Scholar

Ranjini, P. S., Lokesha, V., and Usha, A. (2013). Relation between phenylene and hexagonal squeeze using harmonic index. Int. J. Graph Theory 1, 116–121.

Google Scholar

Raza, Z. (2020). The expected values of arithmetic bond connectivity and geometric indices in random phenylene chains. Heliyon 6 (7), e04479. doi:10.1016/j.heliyon.2020.e04479

PubMed Abstract | CrossRef Full Text | Google Scholar

Raza, Z. (2021). The expected values of some indices in random phenylene chains. Eur. Phys. J. Plus 136 (1), 91–15. doi:10.1140/epjp/s13360-021-01082-y

CrossRef Full Text | Google Scholar

Shirdel, G. H., Rezapour, H., and Sayadi, A. M. (2013). The hyper-Zagreb index of graph operations, Iran. J. Math. Chem. 4, 213–220.

Google Scholar

Shooshtari, H., Sheikholeslami, S. M., and Amjadi, J. (2022). The expected values of hyper Zagreb and forgotten topological indices in random phenylene chains. Polycycl. Aromat. Compd. 1-9. doi:10.1080/10406638.2022.2131851

CrossRef Full Text | Google Scholar

Trinajstic, N. (1992). Chemical graph theory. Boca Raton: CRC Press.

Google Scholar

Wei, L., Bian, H., Yu, H., and Ding, J. (2020). The expected values of Merrifield-Simmons index in random phenylene chains. Iran. J. Math. 11 (4), 271–281. doi:10.22052/IJMC.2020.237192.1508

CrossRef Full Text | Google Scholar

Wei, S., and Shiu, W. C. (2019). Enumeration of Wiener indices in random polygonal chains. J. Math. Analysis Appl. 469 (2), 537–548. doi:10.1016/j.jmaa.2018.09.027

CrossRef Full Text | Google Scholar

Zhang, G., Mushtaq, A., Aslam, A., Parveen, S., and Kanwal, S. (2023b). Studying some networks using topological descriptors and multi-criterion decision making. Mol. Phys. 121, 16. doi:10.1080/00268976.2023.2222345

CrossRef Full Text | Google Scholar

Zhang, X., Aslam, A., Saeed, S., Razzaque, A., and Kanwal, S. (2023a). Investigation for metallic crystals through chemical invariants, QSPR and fuzzy-TOPSIS. J. Biomol. Struct. Dyn. 42, 2316–2327. doi:10.1080/07391102.2023.2209656

PubMed Abstract | CrossRef Full Text | Google Scholar

Zhang, X., Prabhu, S., Arulperumjothi, M., Prabhu, S. M., Arockiaraj, M., and Manimozhi, V. (2024). Distance based topological characterization, graph energy prediction, and NMR patterns of benzene ring embedded in P-type surface in 2D network. Sci. Rep. 14 (1), 23766. doi:10.1038/s41598-024-75193-8

PubMed Abstract | CrossRef Full Text | Google Scholar

Zhao, B., Gan, J., and Wu, H. (2016). Redefined Zagreb indices of some nano structures. Appl. Math. Nonlinear Sci. 1 (1), 291–300. doi:10.21042/amns.2016.1.00024

CrossRef Full Text | Google Scholar

Zhou, B. (2004). Zagreb indices. MATCH Commun. Math. Comput. Chem. 52 (1), 13–118.

Google Scholar

Zhu, X., Wang, H., Wang, K., and Xie, L. (2023). Progress on the in situ imaging of growth dynamics of two-dimensional materials. Nanoscale 15 (28), 11746–11758. doi:10.1039/d3nr01475d

PubMed Abstract | CrossRef Full Text | Google Scholar

Keywords: random square-hexagonal kink chains, topological descriptors, expected values, Randic index, Zagreb indices

Citation: Chen R, Razzaque A, Khalil M, Kanwal S, Noor S and Nazir R (2025) Expected values of topological descriptors for possible kink chains of type 22. Front. Chem. 12:1517892. doi: 10.3389/fchem.2024.1517892

Received: 27 October 2024; Accepted: 16 December 2024;
Published: 18 February 2025.

Edited by:

Jose Luis Cabellos, Polytechnic University of Tapachula, Mexico

Reviewed by:

María Guadalupe Hernández-Linares, Benemérita Universidad Autónoma de Puebla, Mexico
Xianya Geng, Anhui University of Science and Technology, China

Copyright © 2025 Chen, Razzaque, Khalil, Kanwal, Noor and Nazir. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

*Correspondence: Asima Razzaque, YXJhenphcXVlQGtmdS5lZHUuc2E=; Salma Kanwal, c2FsbWEua2Fud2FsQGxjd3UuZWR1LnBr

Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.

Research integrity at Frontiers

Man ultramarathon runner in the mountains he trains at sunset

94% of researchers rate our articles as excellent or good

Learn more about the work of our research integrity team to safeguard the quality of each article we publish.


Find out more