The Expected Values for the Gutman Index and Schultz Index in the Random Regular Polygonal Chains

Abstract

Two famous topological indices, the Gutman index and Schultz index, are studied in this article. We mainly calculate the exact analytical formulae for the expected values of the Gutman index and Schultz index of a random regular polygonal chain with n regular polygons. Moreover, we determine the average values and the extremal values of the indices in regard to the set of all these regular polygonal chains.

1. Introduction

Thus far, chemistry has been extensively studied and applied in graph theory [1,2,3,4]. It is often the case that chemical compounds can be interpreted by chemical graphs, in which vertices represent the atoms and edges stand for the covalent bonds between atoms. The random regular polygonal chains studied here are obtained by randomly connecting n regular polygons through vertex-to-vertex in turn; these connection vertices are termed cut vertex. Meanwhile, the random regular polygonal chains with n regular polygons are spiro compounds, which are a significant class of cycloalkanes in organic chemistry; refer to [5,6]. Spiro compounds have a rigid and stable structure, their chiral ligands have a large specific optical rotation, and they have important applications in asymmetric catalysis, luminescent materials, pesticides, polymer binders and so on.

In theoretical chemistry, topological indices are commonly used to encode molecules, as well as to design compounds with physicochemical properties or biological activity [7]. It is a popular issue to study the topological indices of the chemical chains and their significance.

Throughout this paper, all the graphs that we take into account are finite, undirected and simple; a graph is simple if it has no loops and no two of its links join the same pair of vertices. More detailed notations and terminologies can be found in [8]. Let $G=\left(V\right(G),E(G\left)\right)$ be a disordered graph; $V\left(G\right)$ represents the vertex set and $E\left(G\right)$ stands for the edge set. The degree $d_G\left(u\right)$, or $d\left(u\right)$ for short, is the number of edges connected to the node u($u\in V\left(G\right)$). The length of the shortest path between vertex u and vertex v($u,v\in V\left(G\right)$) is defined as the distance $d_G(u,v)$ (short for $d(u,v)$). The sum of the distances between any two vertices in $V\left(G\right)$ is $d\left(u\right|G)={\sum }_{v\in V\left(G\right)}d(u,v)$.

The Wiener index [9,10,11,12,13,14] is the best-known of all topological indices, which is defined as $W\left(G\right)={\sum }_{\{u,v\}\subseteq V\left(G\right)}{d}_G(u,v)$. By weighting the Wiener index, the Gutman index is proposed as

$$Gut\left(G\right)=\frac{1}{2}\sum _{u\in V_G}\sum _{v\in V_G}\left(d_G\left(u\right)d_G\left(v\right)\right)d_G(u,v)=\sum _{\{u,v\}\subseteq V\left(G\right)}\left(d_G\left(u\right)d_G\left(v\right)\right)d_G(u,v),$$

(1)

which is a kind of vertex-valency-weighted sum of the distance between all pairs of vertices in a graph [15,16,17,18,19]. The index is closely related to the Wiener index and has the same structured features as the Wiener index in the condition of acyclic structures. Therefore, the research for the possible chemical applications of the Gutman index and the theoretical investigations should lay particular emphasis on the condition of polycyclic molecules.

The Schultz index [20] is proposed as

$$S\left(G\right)=\frac{1}{2}\sum _{u\in V_G}\sum _{v\in V_G}(d_G\left(u\right)+d_G\left(v\right))d_G(u,v)=\sum _{\{u,v\}\subseteq V\left(G\right)}(d_G\left(u\right)+d_G\left(v\right))d_G(u,v).$$

(2)

The Schultz index has been shown to be a useful molecular descriptor in the design of molecules with desired properties [21]; thus, further studies on the mathematical and computational properties of the Schultz index are desirable, including more articles on developing such topology indices of the mathematical properties and applications [22].

Many scholars have studied the indices of some random polyphenylene chains before [23,24,25,26,27,28]. Recently, Liu and Zeng et al. [29] obtained some indices in the random spiro chains, including the Gutman index, Schultz index, multiplicative-degree Kirchhoff index and additive-degree Kirchhoff index, and determined the expected values of these indices in the random spiro chain, and the extremal values among all spiro chain with n hexagons. Motivated by [29,30,31], we explore the property of the Gutman index and Schultz index of polygonal regular chains, and determine the expected values of the indices, denoted by $E\left(Gut\left(S{C}_n\right)\right)$ and $E\left(S\left(S{C}_n\right)\right)$ in the random regular polygonal chains with n regular polygons, and we discuss the maximum and minimum of the $E\left(Gut\left(S{C}_n\right)\right)$ and $E\left(S\left(S{C}_n\right)\right)$. Meanwhile, we acquire the extremal values and the average values of the Gutman index and Schultz index among all regular polygonal chains with n regular polygons.

The random regular polygonal chain $S{C}_{n+1}$ with $n+1$ regular polygons consists of a new regular polygon $G_{n+1}$ attaching to the end of a regular polygonal chain $S{C}_n$ with n regular polygons; see Figure 1.

For $n\ge 3$, there are k ways to connect the terminal regular polygon $G_{n+1}$ with the front random regular polygonal chain $S{C}_n$. They can be described as $S{C}_{n+1}^1,S{C}_{n+1}^2,\cdots ,S{C}_{n+1}^{k-1}$ and $S{C}_{n+1}^k$, respectively; see Figure 2.

A random regular polygonal chain $S{C}_n$ with n regular polygons can be obtained by adding a regular polygon at the end of the chain step by step. At each step $t(=3,4,\dots ,n)$, a random connection is made from one of the following k possible cases:

• $S{C}_t\to S{C}_{t+1}^1$ with probability $p_1$,
• $S{C}_t\to S{C}_{t+1}^2$ with probability $p_2$,
• $S{C}_t\to S{C}_{t+1}^3$ with probability $p_3$,

$\cdots \cdots$

• $S{C}_t\to S{C}_{t+1}^k$ with probability $p_k=1-(p_1+p_2+p_3+\cdots +p_{k-1})$,

where the k probabilities $p_1,p_2,\cdots ,p_{k-1}$ and $p_k$ are independent of the step parameter t. When $p_1=1,p_2=p_3=\cdots =p_k=0$, the meta-chain $M_n$ can be obtained. When $p_2=1,p_1=p_3=\cdots =p_k=0$, the orth-chain $O_n^1$ can be obtained. When $p_3=1,p_1=p_2=p_4=\cdots =p_k=0$, the orth-chain $O_n^2$ can be obtained. When $p_{k-1}=1$, the other $k-1$ probabilities reach 0, and we can obtain the orth-chain $O_n^{k-2}$. When $p_k=1,p_1=p_2=\cdots =p_{k-1}=0$, the para-chain $P_n$ can be obtained.

2. The Gutman Index of the Random Regular Polygonal Chain

For the random regular polygonal chain $S{C}_n$, we denote by $S{C}_{n+1}$ the graph acquired by connecting a new terminal regular polygon $G_{n+1}$ to $S{C}_n$, which is spanned by vertices $x_1,x_2,\cdots ,x_{2k}$ and $x_1$ is $u_n$ (see Figure 1). It is evident that, for all $v\in S{C}_n$, we have

$$\begin{array}{c}\hfill d(v,x_j)=\left\{\begin{array}{c}d(v,u_n)+j-1,1\le j\le k\hfill \\ d(v,u_n)+2k+1-j,k+1\le j\le 2k.\hfill \end{array}\right.\end{array}$$

(3)

$$\sum _{v\in V\left(S{C}_n\right)}{d}_{S{C}_{n+1}}\left(v\right)=4kn+2.$$

Meanwhile, we obtain that

$$\begin{array}{c}\hfill \sum _{i=1}^{2k}d\left(x_i\right)d(x_i,x_j)=\left\{\begin{array}{c}2k^2+2(j-1),1\le j\le k\hfill \\ 2k^2+2(2k-j+1),k+1\le j\le 2k.\hfill \end{array}\right.\end{array}$$

(4)

Theorem 1.

The $E[Gut\left(S{C}_n\right)](n\ge 1)$ of the random regular polygonal chain is

$$\begin{array}{ccc}\hfill E[Gut\left(S{C}_n\right)]& =& \frac{8}{3}{k}^2{n}^3[k-\sum _{i=1}^{k-1}(k-i)p_i]+8k^2{n}^2[\sum _{i=1}^{k-1}(k-i)p_i]+\frac{4}{3}{k}^{2}n[k-4\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

Proof. 

Let $Gut\left(S{C}_n\right)=A_1+B_1+C_1$.

$$\begin{array}{ccc}\hfill A_1& =& \sum _{\{u,v\}\subseteq S{C}_n}d\left(u\right)d\left(v\right)d(u,v),\hfill \\ \hfill & =& \sum _{\{u,v\}\subseteq S{C}_n\setminus \left\{u_n\right\}}d\left(u\right)d\left(v\right)d(u,v)+\sum _{v\in S{C}_n\setminus \left\{u_n\right\}}{d}_{S{C}_{n+1}}\left(u_n\right)d\left(v\right)d(u_n,v),\hfill \\ \hfill & =& \sum _{\{u,v\}\subseteq S{C}_n\setminus \left\{u_n\right\}}d\left(u\right)d\left(v\right)d(u,v)+\sum _{v\in S{C}_n\setminus \left\{u_n\right\}}[d_{S{C}_n}\left(u_n\right)+2]d\left(v\right)d(u_n,v),\hfill \\ \hfill & =& Gut\left(S{C}_n\right)+2\sum _{v\in S{C}_n}d\left(v\right)d(u_n,v).\hfill \\ \hfill B_1& =& \sum _{v\in S{C}_n\setminus \left\{u_n\right\}}\sum _{x_i\in G_{n+1}\setminus \left\{x_1\right\}}d\left(v\right)d\left(x_i\right)d(v,x_i),\hfill \\ \hfill & =& \sum _{v\in S{C}_n}\sum _{x_i\in G_n}d\left(v\right)d\left(x_i\right)d(v,x_i)-4\sum _{v\in S{C}_n}d\left(v\right)d(v,u_n)-4\sum _{v\in G_{n+1}}d\left(v\right)d(v,x_1),\hfill \\ \hfill & =& \sum _{v\in S{C}_n}d\left(v\right)\{4d(v,u_n)+4[d(v,u_n)+1]+4[d(v,u_n)+2]+\cdots +4[d(v,u_n)+k-1]+2[d(v,u_n)+k]\},\hfill \\ \hfill & & -4\sum _{v\in S{C}_n}d\left(v\right)d(v,u_n)-4\times 2k^2,\hfill \\ \hfill & =& (4k-2)\sum _{v\in S{C}_n}d\left(v\right)d(v,u_n)+2k^2(4kn-2).\hfill \\ \hfill C_1& =& \sum _{\{x_i,x_j\}\subseteq G_{n+1}}d\left(x_i\right)d\left(x_j\right)d(x_i,x_j),\hfill \\ \hfill & =& \frac{1}{2}\sum _{i=1}^{2k}d\left(x_i\right)(\sum _{j=1}^{2k}d\left(x_j\right)d(x_j,x_i)),\hfill \\ \hfill & =& 4k^2(k+1).\hfill \end{array}$$

Then, $Gut\left(S{C}_{n+1}\right)=Gut\left(S{C}_n\right)+4k{\sum }_{v\in S{C}_n}d\left(v\right)d(v,u_n)+8k^{3}n+4k^3$.

For convenience, we could denote the random variable ${\sum }_{v\in S{C}_n}d\left(v\right)d(v,u_n)$ by

$$U_n^1:=E(\sum _{v\in S{C}_n}d\left(v\right)d(v,u_n)).$$

Therefore, we can obtain a recurrence relation as follows:

$$E\left(Gut\left(S{C}_{n+1}\right)\right)=E\left(Gut\left(S{C}_n\right)\right)+4k{U}_n^1+8k^{3}n+4k^3.$$

By considering the following k possible conditions, it is easy to obtain $U_n^1$.

Condition 1.

$S{C}_n⟶S{C}_{n+1}^1$, then $u_n$ would cover the vertex $x_2$ or $x_{2k}$. Hence, ${\sum }_{v\in V_{S{C}_n}}d(u_n,v)$ can be represented as ${\sum }_{v\in V_{S{C}_n}}d(x_2,v)$ or ${\sum }_{v\in V_{S{C}_n}}d(x_{2k},v)$ with probability $p_1$.

Condition 2.

$S{C}_n⟶S{C}_{n+1}^2$, then $u_n$ would cover the vertex $x_3$ or $x_{2k-1}$. Hence, ${\sum }_{v\in V_{S{C}_n}}d(u_n,v)$ can be represented as ${\sum }_{v\in V_{S{C}_n}}d(x_3,v)$ or ${\sum }_{v\in V_{S{C}_n}}d(x_{2k-1},v)$ with probability $p_2$.

$\cdots \cdots$

Condition 3.

$S{C}_n⟶S{C}_{n+1}^{k-2}$, then $u_n$ would cover the vertex $x_{k-1}$ or $x_{k+3}$. Hence, ${\sum }_{v\in V_{S{C}_n}}d(u_n,v)$ can be represented as ${\sum }_{v\in V_{S{C}_n}}d(x_{k-1},v)$ or ${\sum }_{v\in V_{S{C}_n}}d(x_{k+3},v)$ with probability $p_{k-2}$.

Condition 4.

$S{C}_n⟶S{C}_{n+1}^{k-1}$, then $u_n$ would cover the vertex $x_k$ or $x_{k+2}$. Hence, ${\sum }_{v\in V_{S{C}_n}}d(u_n,v)$ can be represented as ${\sum }_{v\in V_{S{C}_n}}d(x_k,v)$ or ${\sum }_{v\in V_{S{C}_n}}d(x_{k+2},v)$ with probability $p_{k-1}$.

Condition 5.

$S{C}_n⟶S{C}_{n+1}^k$, then $u_n$ would cover the vertex $x_{k+1}$. Hence, ${\sum }_{v\in V_{S{C}_n}}d(u_n,v)$ can be represented as ${\sum }_{v\in V_{S{C}_n}}d(x_{k+1},v)$ with probability $1-p_1-p_2-\cdots -p_{k-1}$.

According to the k conditions, we have that

$$\begin{array}{ccc}\hfill U_n^1& =& p_1\sum _{v\in S{C}_n}d\left(v\right)d(v,x_2)+p_2\sum _{v\in S{C}_n}d\left(v\right)d(v,x_3)+\cdots +p_{k-1}\sum _{v\in S{C}_n}d\left(v\right)d(v,x_k)\hfill \\ \hfill & & +(1-p_1-p_2-\cdots -p_{k-1})\sum _{v\in SP{C}_n}d\left(v\right)d(v,x_{k+1}),\hfill \\ \hfill & =& p_1[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+\sum _{v\in S{C}_{n-1}\setminus \left\{u_{n-1}\right\}}d\left(v\right)+2k^2+2]\hfill \\ \hfill & & +p_2[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+2\sum _{v\in S{C}_{n-1}\setminus \left\{u_{n-1}\right\}}d\left(v\right)+2k^2+4]+\cdots \hfill \\ \hfill & & +p_{k-1}[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+(k-1)\sum _{v\in S{C}_{n-1}\setminus \left\{u_{n-1}\right\}}d\left(v\right)+2k^2+2(k-1)]\hfill \\ \hfill & & +(1-p_1-p_2-\cdots -p_{k-1})[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+k\sum _{v\in S{C}_{n-1}\setminus \left\{u_{n-1}\right\}}d\left(v\right)+2k^2+2k],\hfill \end{array}$$

$$\begin{array}{ccc}\hfill & =& p_1[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+4k(n-1)+2k^2]+p_2[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+2·4k(n-1)+2k^2]\hfill \\ \hfill & & +\cdots +p_{k-1}[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+(k-1)·4k(n-1)+2k^2]\hfill \\ \hfill & & +(1-p_1-p_2-\cdots -p_{k-1})[\sum _{v\in S{C}_{n-1}}d\left(v\right)d(v,u_{n-1})+k·4k(n-1)+2k^2],\hfill \\ \hfill & =& U_{n-1}^1+[4k^2-(k-1)·4k{p}_1-(k-2)·4k{p}_2-\cdots -4k{p}_{k-1}]n\hfill \\ \hfill & & +[-2k^2+(k-1)·4k{p}_1+(k-2)·4k{p}_2+\cdots +4k{p}_{k-1}],\hfill \\ \hfill & =& U_{n-1}^1+[4k^2-4k\sum _{i=1}^{k-1}(k-i)p_i]n+[-2k^2+4k\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

Moreover, the original value is $U_1^1={\sum }_{v\in S{C}_1}d\left(v\right)d(v,u_1)=2k^2$. Thus,

$$U_n^1=[2k^2-2k\sum _{i=1}^{k-1}(k-i)p_i]n^2+[2k\sum _{i=1}^{k-1}(k-i)p_i]n.$$

Due to

$$\begin{array}{ccc}\hfill E\left(Gut\left(S{C}_{n+1}\right)\right)& =& E\left(Gut\left(S{C}_n\right)\right)+4k{U}_n^1+8k^{3}n+4k^3,\hfill \\ \hfill & =& E\left(Gut\left(SP{C}_n\right)\right)+8k^2{n}^2[k-(k-1)p_1-(k-2)p_2-\cdots -p_{k-1}],\hfill \\ \hfill & & +8k^{2}n[k+(k-1)p_1+(k-2)p_2+\cdots +p_{k-1}]+4k^3,\hfill \\ \hfill & =& E\left(Gut\left(SP{C}_n\right)\right)+8k^2{n}^2[k-\sum _{i=1}^{k-1}(k-i)p_i]+8k^{2}n[k+\sum _{i=1}^{k-1}(k-i)p_i]+4k^3.\hfill \end{array}$$

From the original value, $E\left(Gut\left(S{C}_1\right)\right)=2\times 2\times 2k\times \frac{1}{2}\times [1\times 2+2\times 2+\cdots +2\times (k-1)+k]=4k^3$, and the above recurrence relation, we may calculate that

$$\begin{array}{ccc}\hfill E\left(Gut\left(S{C}_n\right)\right)& =& E\left(Gut\left(S{C}_n\right)\right)=\frac{8}{3}{k}^2{n}^3[k-(k-1)p_1-(k-2)p_2-\cdots -p_{k-1}]\hfill \\ \hfill & & +8k^2{n}^2[(k-1)p_1+(k-2)p_2+\cdots +p_{k-1}]\hfill \\ \hfill & & +\frac{4}{3}{k}^{2}n[k-4(k-1)p_1-4(k-2)p_2-\cdots -4p_{k-1}],\hfill \\ \hfill & =& \frac{8}{3}{k}^2{n}^3[k-\sum _{i=1}^{k-1}(k-i)p_i]+8k^2{n}^2[\sum _{i=1}^{k-1}(k-i)p_i]+\frac{4}{3}{k}^{2}n[k-4\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

The proof is complete. □

According to the proof of Theorem 1, if $p_1=1$, each of the other $k-1$ probabilities is equal to 0, and then we have $S{C}_n\cong M_n$. Likewise, if $p_2=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong O_n^1$; if $p_3=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong O_n^2$ and so on; if $p_{k-1}=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong O_n^{k-2}$; if $p_k=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong P_n$.

Corollary 1.

The Gutman indices of $M_n$, $O_n^1,O_n^2,\cdots ,O_n^{k-2}$, $P_n$ are

$$Gut\left(M_n\right)=\frac{8}{3}{k}^2{n}^3+8k^2(k-1)n^2+\frac{4}{3}{k}^2(4-3k)n;$$

$$Gut\left(O_n^1\right)=2·\frac{8}{3}{k}^2{n}^3+8k^2(k-2)n^2+\frac{4}{3}(8-3k)k^{2}n;$$

$$Gut\left(O_n^2\right)=3·\frac{8}{3}{k}^2{n}^3+8k^2(k-3)n^2+\frac{4}{3}(12-3k)k^{2}n;$$

$$\cdots \cdots$$

$$Gut\left(O_n^{k-2}\right)=(k-1)·\frac{8}{3}{k}^2{n}^3+8k^2{n}^2+\frac{4}{3}[(k-1)·4-3k]k^{2}n;$$

$$Gut\left(P_n\right)=\frac{8}{3}{k}^3{n}^3+\frac{4}{3}{k}^{3}n.$$

Corollary 2.

Among all polygonal chains with $n(n⩾3)$ 2k polygons, $P_n$ realizes the maximum of $E\left(Gut\left(S{C}_n\right)\right)$ and $M_n$ realizes the minimum of $E\left(Gut\left(S{C}_n\right)\right)$.

Proof. 

By Theorem 1, we have

$$\begin{array}{ccc}\hfill f_1& =& E\left(Gut\left(S{C}_n\right)\right),\hfill \\ \hfill & =& [-\frac{8}{3}{k}^2(k-1)n^3+8k^2(k-1)n^2-\frac{16}{3}{k}^2(k-1)n]p_1\hfill \\ \hfill & & +[-\frac{8}{3}{k}^2(k-2)n^3+8k^2(k-2)n^2-\frac{16}{3}{k}^2(k-2)n]p_2+\cdots \hfill \\ \hfill & & +[-\frac{8}{3}{k}^2{n}^3+8k^2{n}^2-\frac{16}{3}{k}^{2}n]p_{k-1}+(\frac{8}{3}{k}^3{n}^3+\frac{4}{3}{k}^{3}n).\hfill \end{array}$$

as $n\ge 3$, we have that

$$\frac{\partial f_1}{\partial p_1}=-\frac{8}{3}{k}^2(k-1)n^3+8k^2(k-1)n^2-\frac{16}{3}{k}^2(k-1)n<0;$$

$$\frac{\partial f_1}{\partial p_2}=-\frac{8}{3}{k}^2(k-2)n^3+8k^2(k-2)n^2-\frac{16}{3}{k}^2(k-2)n<0;$$

$$\cdots \cdots$$

$$\frac{\partial f_1}{\partial p_{k-1}}=-\frac{8}{3}{k}^2{n}^3+8k^2{n}^2-\frac{16}{3}{k}^{2}n<0.$$

When $(p_1,p_2,\cdots ,p_{k-1},p_k)=(0,0,\cdots ,0,1)$, $P_n$ realizes the maximum of $E[Gut\left(S{C}_n\right)]$, thus, $S{C}_n\cong P_n$. If $p_k=0$,$p_1+p_2+\cdots +p_{k-1}=1$, we can translate this into $p_{k-1}=1-p_1-p_2-\cdots -p_{k-2}(0\le p_l\le 1,l\in [1,k-2])$, then

$$\begin{array}{ccc}\hfill E[Gut\left(S{C}_n\right)]& =& [-\frac{8}{3}{k}^2(k-1)n^3+8k^2(k-1)n^2-\frac{16}{3}{k}^2(k-1)n]p_1\hfill \\ \hfill & & +[-\frac{8}{3}{k}^2(k-2)n^3+8k^2(k-2)n^2-\frac{16}{3}{k}^2(k-2)n]p_2+\cdots \hfill \\ \hfill & & +[-\frac{8}{3}{k}^2{n}^3+8k^2{n}^2-\frac{16}{3}{k}^{2}n](1-p_1-p_2-\cdots -p_{k-2})\hfill \\ \hfill & & +(\frac{8}{3}{k}^3{n}^3+\frac{4}{3}{k}^{3}n).\hfill \end{array}$$

Thus,

$$\begin{array}{cc}\hfill \frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_1}& =-\frac{8}{3}{k}^2(k-2)n^3+8k^2(k-2)n^2-\frac{16}{3}{k}^2(k-2)n<0,\hfill \\ \hfill \frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_2}& =-\frac{8}{3}{k}^2(k-3)n^3+8k^2(k-3)n^2-\frac{16}{3}{k}^2(k-3)n<0,\hfill \end{array}$$

$$\cdots \cdots$$

$$\begin{array}{cc}\hfill \frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_{k-2}}& =-\frac{8}{3}{k}^2{n}^3+8k^2{n}^2-\frac{16}{3}{k}^{2}n<0.\hfill \end{array}$$

However, $p_1=p_2=\cdots =p_{k-2}=0$ (i.e., $p_{k-1}=1$), and we cannot acquire the minimum value of $E\left(Gut\left(S{C}_n\right)\right)$. Thus, we consider $p_1+p_2+\cdots +p_{k-2}=1$, then $p_{k-2}=1-p_1-p_2-\cdots -p_{k-3}(0\le p_l\le 1,l\in [1,k-3])$.

$$\begin{array}{ccc}\hfill E[Gut\left(S{C}_n\right)]& =& [-\frac{8}{3}{k}^2(k-1)n^3+8k^2(k-1)n^2-\frac{16}{3}{k}^2(k-1)n]p_1\hfill \\ \hfill & & +[-\frac{8}{3}{k}^2(k-2)n^3+8k^2(k-2)n^2-\frac{16}{3}{k}^2(k-2)n]p_2+\cdots \hfill \\ \hfill & & +[-2·\frac{8}{3}{k}^2{n}^3+2·8k^2{n}^2-2·\frac{16}{3}{k}^{2}n](1-p_1-p_2-\cdots -p_{k-3})\hfill \\ \hfill & & +(\frac{8}{3}{k}^3{n}^3+\frac{4}{3}{k}^{3}n).\hfill \end{array}$$

Thus,

$$\begin{array}{cc}\hfill \frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_1}& =-\frac{8}{3}{k}^2(k-3)n^3+8k^2(k-3)n^2-\frac{16}{3}{k}^2(k-3)n<0,\hfill \\ \hfill \frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_2}& =-\frac{8}{3}{k}^2(k-4)n^3+8k^2(k-4)n^2-\frac{16}{3}{k}^2(k-4)n<0,\hfill \end{array}$$

$$\cdots \cdots$$

$$\begin{array}{cc}\hfill \frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_{k-3}}& =-\frac{8}{3}{k}^2{n}^3+8k^2{n}^2-\frac{16}{3}{k}^{2}n<0.\hfill \end{array}$$

However, $p_1=p_2=\cdots =p_{k-3}=0$ (i.e., $p_{k-2}=1$), and $E\left(Gut\left(S{C}_n\right)\right)$ cannot attain the minimum value. By this analogy, if $p_1+p_2=1$, let $p_1=1-p_2(0\le p_2\le 1)$.

$$\begin{array}{ccc}\hfill E[Gut\left(S{C}_n\right)]& =& [-\frac{8}{3}{k}^2(k-1)n^3+8k^2(k-1)n^2-\frac{16}{3}{k}^2(k-1)n](1-p_2)\hfill \\ \hfill & & +[-\frac{8}{3}{k}^2(k-2)n^3+8k^2(k-2)n^2-\frac{16}{3}{k}^2(k-2)n]p_2\hfill \\ \hfill & & +(\frac{8}{3}{k}^3{n}^3+\frac{4}{3}{k}^{3}n).\hfill \end{array}$$

Thus,

$$\frac{\partial E\left(Gut\left(S{C}_n\right)\right)}{\partial p_2}=\frac{8}{3}{k}^2{n}^3-8k^2{n}^2+\frac{16}{3}{k}^{2}n>0.$$

Therefore, $E\left(Gut\left(S{C}_n\right)\right)$ achieves the minimum value, if $p_1=1,p_2=0$, which will be $S{C}_n\cong M_n$. This completes the proof. □

3. The Schultz Index of the Random Regular Polygonal Chain

The Schultz index of a random polygonal chain $S{C}_n$ is a random variable. We calculate the expected value of $S\left(S{C}_n\right)$ as follows. Denote by $E\left(S\left(S{C}_n\right)\right)$ the expected value of the Schultz index of the random polygonal chain $S{C}_n$.

Theorem 2.

The $E[S\left(S{C}_n\right)](n\ge 1)$ of the random regular polygonal chain is

$$\begin{array}{ccc}\hfill E[S\left(S{C}_n\right)]& =& \frac{4k(2k-1)}{3}{n}^3[k-\sum _{i=1}^{k-1}(k-i)p_i]+2k{n}^2[k+2(2k-1)\sum _{i=1}^{k-1}(k-i)p_i]\hfill \\ \hfill & & +\frac{2k(2k-1)}{3}n[k-4\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

Proof. 

Let $S\left(S{C}_n\right)=A_2+B_2+C_2$.

$$\begin{array}{ccc}\hfill A_2& =& \sum _{\{u,v\}\subseteq S{C}_n}[d\left(u\right)+d\left(v\right)]d(u,v),\hfill \\ \hfill & =& \sum _{\{u,v\}\subseteq S{C}_n\setminus \left\{u_n\right\}}[d\left(u\right)+d\left(v\right)]d(u,v)+\sum _{v\in S{C}_n\setminus \left\{u_n\right\}}[d_{S{C}_{n+1}}\left(u_n\right)+d\left(v\right)]d(u_n,v),\hfill \\ \hfill & =& \sum _{\{u,v\}\subseteq S{C}_n\setminus \left\{u_n\right\}}[d\left(u\right)+d\left(v\right)]d(u,v)+\sum _{v\in S{C}_n\setminus \left\{u_n\right\}}[d_{S{C}_n}\left(u_n\right)+2+d\left(v\right)]d(u_n,v),\hfill \\ \hfill & =& S\left(S{C}_n\right)+2\sum _{v\in S{C}_n}d(u_n,v),\hfill \\ \hfill & =& S\left(S{C}_n\right)+2d\left(u_n\right|S{C}_n).\hfill \\ \hfill B_2& =& \sum _{v\in S{C}_n\setminus \left\{u_n\right\}}\sum _{x_i\in G_{n+1}\setminus \left\{x_1\right\}}[d\left(v\right)+d\left(x_i\right)]d(v,x_i),\hfill \\ \hfill & =& \sum _{v\in S{C}_n}\sum _{x_i\in G_n}[d\left(v\right)+d\left(x_i\right)]d(v,x_i)-\sum _{v\in S{C}_n}[d\left(v\right)+4]d(v,u_n)-\sum _{v\in G_{n+1}}[d\left(v\right)+4]d(v,x_1),\hfill \\ \hfill & =& \sum _{v\in S{C}_n}d\left(v\right)\{d(v,u_n)+2[d(v,u_n)+1]+2[d(v,u_n)+2]+\cdots +2[d(v,u_n)+k-1]+[d(v,u_n)+k]\}\hfill \\ \hfill & & +\sum _{v\in S{C}_n}\{4d(v,u_n)+4[d(v,u_n)+1]+4[d(v,u_n)+2]+\cdots +4[d(v,u_n)+k-1]+2[d(v,u_n)+k]\}\hfill \\ \hfill & & -\sum _{v\in S{C}_n}d\left(v\right)d(v,u_n)-4\sum _{v\in S{C}_n}d(v,u_n)-6k^2,\hfill \\ \hfill & =& (2k-1)\sum _{v\in S{C}_n}d\left(v\right)d(v,u_n)+(4k-2)d\left(u_n\right|S{C}_n)+(8k^3-2k^2)n-2k^2.\hfill \\ \hfill C_2& =& \sum _{\{x_i,x_j\}\subseteq G_{n+1}}[d\left(x_i\right)+d\left(x_j\right)]d(x_i,x_j),\hfill \\ \hfill & =& \sum _{i=1}^{2k}d\left(x_i\right)\sum _{j=1}^{2k}d(x_j,x_i),\hfill \\ \hfill & =& 4k^3+2k^2.\hfill \end{array}$$

Then, $S\left(S{C}_{n+1}\right)=S\left(S{C}_n\right)+(2k-1){\sum }_{v\in S{C}_n}d\left(v\right)d(v,u_n)+4kd\left(u_n\right|SP{C}_n)+(8k^3-2k^2)n+4k^3$.

For convenience, we could denote the random variable $d\left(u_n\right|S{C}_n)$ by

$$U_n^2:=E\left(d\left(u_n\right|S{C}_n)\right).$$

Therefore, we can obtain a recurrence relation as follows:

$$E\left(S\left(S{C}_{n+1}\right)\right)=E\left(S\left(S{C}_n\right)\right)+7U_n^1+16U_n^2+480n+256$$

By considering the following k possible conditions, it is easy to obtain $U_n^2$.

Condition 6.

$S{C}_n⟶S{C}_{n+1}^1$, then $u_n$ would cover the vertex $x_2$ or $x_{2k}$. Hence, $d\left(u_n\right|S{C}_n)$ can be represented as $d\left(x_2\right|S{C}_n)$ or $d\left(x_{2k}\right|S{C}_n)$ with probability $p_1$.

Condition 7.

$S{C}_n⟶S{C}_{n+1}^2$, then $u_n$ would cover the vertex $x_3$ or $x_{2k-1}$. Hence, $d\left(u_n\right|S{C}_n)$ can be represented as $d\left(x_3\right|S{C}_n)$ or $d\left(x_{2k-1}\right|S{C}_n)$ with probability $p_2$.

$$\cdots \cdots$$

Condition 8.

$S{C}_n⟶S{C}_{n+1}^{k-2}$, then $u_n$ would cover the vertex $x_{k-1}$ or $x_{k+3}$. Hence, $d\left(u_n\right|S{C}_n)$ can be represented as $d\left(x_{k-1}\right|S{C}_n)$ or $d\left(x_{k+3}\right|S{C}_n)$ with probability $p_{k-2}$.

Condition 9.

$S{C}_n⟶S{C}_{n+1}^{k-1}$, then $u_n$ would cover the vertex $x_k$ or $x_{k+2}$. Hence, $d\left(u_n\right|S{C}_n)$ can be represented as $d\left(x_k\right|S{C}_n)$ or $d\left(x_{k+2}\right|S{C}_n)$ with probability $p_{k-1}$.

Condition 10.

$S{C}_n⟶S{C}_{n+1}^k$, then $u_n$ would cover the vertex $x_{k+1}$. Hence, $d\left(u_n\right|S{C}_n)$ can be represented as $d\left(x_{k+1}\right|S{C}_n)$ with probability $1-p_1-p_2-\cdots -p_{k-1}$.

According to the k conditions, we have that

$$\begin{array}{ccc}\hfill U_n^2& =& p_{1}d\left(x_2\right|S{C}_n)+p_{2}d\left(x_3\right|S{C}_n)+\cdots +p_{k-1}d\left(x_k\right|S{C}_n)+(1-p_1-p_2-\cdots -p_{k-1})d\left(x_{k+1}\right|S{C}_n),\hfill \\ \hfill & =& p_1[d\left(u_{n-1}\right|S{C}_n)+(2k-1)(n-1)+k^2]+p_2[d\left(u_{n-1}\right|S{C}_n)+2(2k-1)(n-1)+k^2]+\cdots \hfill \\ \hfill & & +p_{k-1}[d\left(u_{n-1}\right|S{C}_n)+(k-1)(2k-1)(n-1)+k^2]\hfill \\ \hfill & & +(1-p_1-p_2-\cdots -p_{k-1})[d\left(u_{n-1}\right|S{C}_n)+k(2k-1)(n-1)+k^2],\hfill \\ \hfill & =& U_{n-1}^2+[k(2k-1)-(k-1)(2k-1)p_1-(k-2)(2k-1)p_2-\cdots -(2k-1)p_{k-1}]n\hfill \\ \hfill & & +[(k-k^2)+(k-1)(2k-1)p_1+(k-2)(2k-1)p_2+\cdots +(2k-1)p_{k-1}],\hfill \\ \hfill & =& U_{n-1}^2+[k(2k-1)-(2k-1)\sum _{i=1}^{k-1}(k-i)p_i]n+[(k-k^2)+(2k-1)\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

Moreover, the original value is $U_1^2=d\left(u_1\right|S{C}_1)=k^2$. Thus,

$$\begin{array}{ccc}\hfill U_n^2& =& \frac{1}{2}[k(2k-1)-(k-1)(2k-1)p_1-(k-2)(2k-1)p_2-\cdots -(2k-1)p_{k-1}]n^2\hfill \\ \hfill & =& +\frac{1}{2}[k+(k-1)(2k-1)p_1+(k-2)(2k-1)p_2+\cdots +(2k-1)p_{k-1}]n,\hfill \\ \hfill & =& \frac{1}{2}[k(2k-1)-(2k-1)\sum _{i-1}^{k-1}(k-i)p_i]n^2+\frac{1}{2}[k+(2k-1)\sum _{i=1}^{k-1}(k-i)p_i]n.\hfill \end{array}$$

Due to

$$\begin{array}{ccc}\hfill E\left(S\left(S{C}_{n+1}\right)\right)& =& E\left(S\left(S{C}_n\right)\right)+(2k-1)U_n^1+4k{U}_n^2+(8k^3-2k^2)n+4k^3,\hfill \\ \hfill & =& E\left(S\left(S{C}_n\right)\right)+4k(2k-1)n^2[k-(k-1)p_1-(k-2)p_2-\cdots -p_{k-1}]\hfill \\ \hfill & & +4kn[2k^2+(k-1)(2k-1)p_1+(k-2)(2k-1)p_2+\cdots +(2k-1)p_{k-1}]+4k^3,\hfill \\ \hfill & =& E\left(S\left(S{C}_n\right)\right)+4k(2k-1)n^2[k-\sum _{i=1}^{k-1}(k-i)p_i]+4kn[2k^2+(2k-1)\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

From the original value, $E\left(S\left(S{C}_1\right)\right)=k^2\times 2k\times 2=4k^3$, and the above recurrence relation, we may calculate that

$$\begin{array}{ccc}\hfill E\left(S\left(S{C}_n\right)\right)& =& \frac{4k(2k-1)}{3}{n}^3[k-(k-1)p_1-(k-2)p_2-\cdots -p_{k-1}]\hfill \\ \hfill & & +2k{n}^2[k+2(k-1)(2k-1)p_1+2(k-2)(2k-1)p_2+\cdots +2(2k-1)p_{k-1}]\hfill \\ \hfill & & +\frac{2k(2k-1)}{3}n[k-4(k-1)p_1-4(k-2)p_2-\cdots -4p_{k-1}],\hfill \\ \hfill & =& \frac{4k(2k-1)}{3}{n}^3[k-\sum _{i=1}^{k-1}(k-i)p_i]+2k{n}^2[k+2(2k-1)\sum _{i=1}^{k-1}(k-i)p_i]\hfill \\ \hfill & & +\frac{2k(2k-1)}{3}n[k-4\sum _{i=1}^{k-1}(k-i)p_i].\hfill \end{array}$$

The proof is complete. □

According to the proof of Theorem 2, if $p_1=1$, each of the other $k-1$ probabilities is equal to 0, and then we have $S{C}_n\cong M_n$. Likewise, if $p_2=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong O_n^1$; if $p_3=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong O_n^2$ and so on; if $p_{k-1}=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong O_n^{k-2}$; if $p_k=1$, each of the other $k-1$ probabilities is equal to 0, and then $S{C}_n\cong P_n$.

Corollary 3.

The Schultz indices of $M_n$, $O_n^1,O_n^2,\cdots ,O_n^{k-2}$, $P_n$ are

$$S\left(M_n\right)=\frac{4k(2k-1)}{3}{n}^3+2k(2k-1)(k-1)n^2+\frac{2k(2k-1)(4-3k)}{3}n;$$

$$S\left(O_n^1\right)=2·\frac{4k(2k-1)}{3}{n}^3+2k[2(2k-1)(k-2)+k]n^2+\frac{2k(2k-1)}{3}[k+4(2-k)]n;$$

$$S\left(O_n^2\right)=3·\frac{4k(2k-1)}{3}{n}^3+2k[2(2k-1)(k-3)+k]n^2+\frac{2k(2k-1)}{3}[k+4(3-k)]n;$$

$$\cdots \cdots$$

$$S\left(O_n^{k-2}\right)=(k-1)·\frac{4k(2k-1)}{3}{n}^3+2k[2(2k-1)+k]n^2+\frac{2k(2k-1)}{3}[k+4(-1)]n;$$

$$S\left(P_n\right)=k·\frac{4k(2k-1)}{3}{n}^3+2k·k{n}^2+k·\frac{2k(2k-1)}{3}n.$$

Corollary 4.

Among all polygonal chains with $n(n⩾3)$ 2k polygons, $P_n$ realizes the maximum of $E\left(S\left(S{C}_n\right)\right)$ and the meta-chain $M_n$ realizes that of the minimum.

Proof. 

By Theorem 2, we can deduce

$$\begin{array}{ccc}\hfill f_2& =& E\left(S\left(S{C}_n\right)\right),\hfill \\ \hfill & =& (2k-1)[-\frac{4k(k-1)}{3}{n}^3+4k(k-1)n^2-\frac{8k(k-1)}{3}n]p_1\hfill \\ \hfill & & +(2k-1)[-\frac{4k(k-2)}{3}{n}^3+4k(k-2)n^2-\frac{8k(k-2)}{3}n]p_2+\cdots \hfill \\ \hfill & & +(2k-1)[-\frac{4k}{3}{n}^3+4k{n}^2-\frac{8k}{3}n]p_{k-1}+[\frac{4k(2k-1)}{3}k{n}^3+2k·k{n}^2+\frac{2k^2(2k-1)}{3}n].\hfill \end{array}$$

as $n\ge 3$, we have that

$$\frac{\partial f_2}{\partial p_1}=(2k-1)[-\frac{4k(k-1)}{3}{k}^2{n}^3+4k(k-1)n^2-\frac{8k(k-1)}{3}n]<0;$$

$$\frac{\partial f_2}{\partial p_2}=(2k-1)[-\frac{4k(k-2)}{3}{k}^2{n}^3+4k(k-2)n^2-\frac{8k(k-2)}{3}n]<0;$$

$$\cdots \cdots$$

$$\frac{\partial f_2}{\partial p_{k-1}}=(2k-1)[-\frac{4k}{3}{k}^2{n}^3+4k{n}^2-\frac{8k}{3}n]<0.$$

When $(p_1,p_2,\cdots ,p_{k-1},p_k)=(0,0,\cdots ,0,1)$, $P_n$ realizes the maximum of $E[S\left(S{C}_n\right)]$; thus, $S{C}_n\cong P_n$. If $p_k=0$,$p_1+p_2+\cdots +p_{k-1}=1$, we can translate this into $p_{k-1}=1-p_1-p_2-\cdots -p_{k-2}(0\le p_l\le 1,l\in [1,k-2])$, then

$$\begin{array}{ccc}\hfill E[S\left(S{C}_n\right)]& =& (2k-1)[-\frac{4k(k-1)}{3}{n}^3+4k(k-1)n^2-\frac{8k(k-1)}{3}n]p_1\hfill \\ \hfill & & +(2k-1)[-\frac{4k(k-2)}{3}{n}^3+4k(k-2)n^2-\frac{8k(k-2)}{3}n]p_2+\cdots \hfill \\ \hfill & & +(2k-1)[-\frac{4k}{3}{n}^3+4k{n}^2-\frac{8k}{3}n](1-p_1-p_2-\cdots -p_{k-2})\hfill \\ \hfill & & +[\frac{4k(2k-1)}{3}k{n}^3+2k·k{n}^2+\frac{2k^2(2k-1)}{3}n].\hfill \end{array}$$

Thus,

$$\begin{array}{cc}\hfill \frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_1}& =(2k-1)[-\frac{4k(k-2)}{3}{n}^3+4k(k-2)n^2-\frac{8k(k-2)}{3}n]<0,\hfill \\ \hfill \frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_2}& =(2k-1)[-\frac{4k(k-3)}{3}{n}^3+4k(k-3)n^2-\frac{8k(k-3)}{3}n]<0,\hfill \end{array}$$

$$\cdots \cdots$$

$$\begin{array}{cc}\hfill \frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_{k-2}}& =(2k-1)[-\frac{4k}{3}{n}^3+4k{n}^2-\frac{8k}{3}n]<0.\hfill \end{array}$$

However, $p_1=p_2=\cdots =p_{k-2}=0$ (i.e., $p_{k-1}=1$), and we cannot acquire the minimum value of $E\left(S\left(S{C}_n\right)\right)$. Thus, consider $p_1+p_2+\cdots +p_{k-2}=1$, then $p_{k-2}=1-p_1-p_2-\cdots -p_{k-3}(0\le p_l\le 1,l\in [1,k-3])$.

$$\begin{array}{ccc}\hfill E[S\left(S{C}_n\right)]& =& (2k-1)[-\frac{4k(k-1)}{3}{n}^3+4k(k-1)n^2-\frac{8k(k-1)}{3}n]p_1\hfill \\ \hfill & & +(2k-1)[-\frac{4k(k-2)}{3}{n}^3+4k(k-2)n^2-\frac{8k(k-2)}{3}n]p_2+\cdots \hfill \\ \hfill & & +(2k-1)[-2·\frac{4k}{3}{n}^3+2·4k{n}^2-2·\frac{8k}{3}n](1-p_1-p_2-\cdots -p_{k-3})\hfill \\ \hfill & & +[\frac{4k(2k-1)}{3}{n}^3+2k·k{n}^2+\frac{2k(2k-1)}{3}n]\hfill \\ \hfill & & +[\frac{4k(2k-1)}{3}k{n}^3+2k·k{n}^2+\frac{2k^2(2k-1)}{3}n].\hfill \end{array}$$

Thus,

$$\begin{array}{cc}\hfill \frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_1}& =(2k-1)[-\frac{4k(k-3)}{3}{n}^3+4k(k-3)n^2-\frac{8k(k-3)}{3}n]<0,\hfill \\ \hfill \frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_2}& =(2k-1)[-\frac{4k(k-4)}{3}{n}^3+4k(k-4)n^2-\frac{8k(k-4)}{3}n]<0,\hfill \end{array}$$

$$\cdots \cdots$$

$$\begin{array}{cc}\hfill \frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_{k-3}}& =(2k-1)[-\frac{4k}{3}{n}^3+4k{n}^2-\frac{8k}{3}n]<0.\hfill \end{array}$$

However, $p_1=p_2=\cdots =p_{k-3}=0$ (i.e., $p_{k-2}=1$), and $E\left(S\left(S{C}_n\right)\right)$ cannot attain the minimum value. By this analogy, if $p_1+p_2=1$, let $p_1=1-p_2(0\le p_2\le 1)$.

$$\begin{array}{ccc}\hfill E[S\left(S{C}_n\right)]& =& (2k-1)[-\frac{4k(k-1)}{3}{n}^3+4k(k-1)n^2-\frac{8k(k-1)}{3}n](1-p_2)\hfill \\ \hfill & & +(2k-1)[-\frac{4k(k-2)}{3}{n}^3+4k(k-2)n^2-\frac{8k(k-2)}{3}n]p_2.\hfill \end{array}$$

Thus,

$$\frac{\partial E\left(S\left(S{C}_n\right)\right)}{\partial p_2}=(2k-1)[\frac{4k}{3}{n}^3-4k{n}^2+\frac{8k}{3}n]>0.$$

Therefore, $E\left(S\left(S{C}_n\right)\right)$ achieves the minimum value, if $p_1=1,p_2=0$, which will be $S{C}_n\cong M_n$. This completes the proof. □

4. Average Values of the Indices

Denote by $\overline{{\xi }_n}$ the set of all the polygonal chains that consist of n regular polygons. In this section, we can characterize the average values of the Gutman index and Schultz index about $\overline{{\xi }_n}$.

$$Gu{t}_{ave}\left(\overline{{\xi }_n}\right)=\frac{1}{|\overline{{\xi }_n}|}\sum _{G\in G_n}Gut\left(G\right);S_{ave}\left(\overline{{\xi }_n}\right)=\frac{1}{|\overline{{\xi }_n}|}\sum _{G\in G_n}S\left(G\right);$$

Let $p_1=p_2=\cdots =\frac{1}{k}$; from Theorems 1, 2, we can obtain the following result.

Theorem 3.

The average values for the indices about $\overline{{\xi }_n}$ are

$$Gu{t}_{avr}\left(\overline{{\xi }_n}\right)=\frac{4k^2(k+1)}{3}{n}^3+4k^2(k-1)n^2+\frac{4k^2(-k+2)}{3}n;$$

$$S_{avr}\left(\overline{{\xi }_n}\right)=\frac{2k(2k-1)(k+1)}{3}{n}^3+2k(2k^2-2k+1)n^2+\frac{2k(2k-1)(-k+2)}{3}n.$$

After verification, the equation is

$$Gu{t}_{avr}\left(\overline{{\xi }_n}\right)=\frac{1}{k}Gut\left(\overline{M_n}\right)+\frac{1}{k}Gut\left(\overline{O_n^1}\right)+\frac{1}{k}Gut\left(\overline{O_n^2}\right)+\cdots +\frac{1}{k}Gut\left(\overline{P_n}\right);$$

$$S_{avr}\left(\overline{{\xi }_n}\right)=\frac{1}{k}S\left(\overline{M_n}\right)+\frac{1}{k}S\left(\overline{O_n^1}\right)+\frac{1}{k}S\left(\overline{O_n^2}\right)+\cdots +\frac{1}{k}S\left(\overline{P_n}\right).$$

5. Concluding Remarks

We mainly established the exact formulae for the expected values $E\left(Gut\left(S{C}_n\right)\right)$ and $E\left(S\left(S{C}_n\right)\right)$ of a random regular polygonal chain, and discussed the maximum and the minimum of $E\left(Gut\left(S{C}_n\right)\right)$ and $E\left(S\left(S{C}_n\right)\right)$; meanwhile, we obtained the average values $Gu{t}_{ave}\left(\overline{{\xi }_n}\right)$ and $S_{ave}\left(\overline{{\xi }_n}\right)$, and it was finally determined that the extremal values of the indices would be obtained in this case. This paper not only proves the correctness of the previous work, but also summarizes the expected values of the Gutman index and Schultz index for all polygons containing an even number of edges. The results of this paper are helpful for the future study of topological exponentials and for building some form of mathematical model from the structure of the chemical, such as spiro compounds and alkanes whose molecular formula is $C_n{H}_{2n+2}$. Then, we may use this model to predict the activity and the physicochemical properties of other novel substances, which can provide the microscopic basis for new molecules in synthetic chemistry. It would be interesting to establish formulae for the expected values or variances of some other indices in a random irregular polygonal chain with n irregular polygons.