Topological Properties of Polymeric Networks Modelled by Generalized Sierpiński Graphs

Abstract

In this article, we compute the irregularity measures of generalized Sierpiński graphs and obtain some bounds on these irregularities. Moreover, we discuss some bounds on connectivity indices for generalized Sierpiński graphs of any arbitrary graph H along with classification of the extremal graphs used to attain them.

1. Introduction

For many years, the topic of polymer networks has been of great importance in research. The properties of polymer networks rely on the structure of polymer chains and how these chains are cemented to form a network. The primary study of polymer modelling began with linear polymeric structures, but nowadays, researchers are focusing their attention on the complex underlying geometries as well as fractal generalized networks.

In theoretical chemistry, a numerical quantity is used to gain information about the chemical, physical or biological properties of organic substances. This numerical quantity is obtained by applying mathematical definitions to the molecular structures of the substance, and it is called a topological index.

We consider simple, finite, connected and undirected graphs in our present study. Graph theoretic terminologies that are not defined here can be found in [1]. Let $H=H(V,E)$ be a graph, with V as its node set and E its edge set. The cardinalities of V and E are of order n and size m of H, respectively. The total number of nodes adjacent to a node $x\in V$ is the degree of x in H, denoted by $d_H\left(x\right)$ or simply $d\left(x\right)$. $P_n$ and $S_n$ are path and star graphs, respectively, with n nodes.

In 1998, Bollobás et al. [2] introduced the following definition of the generalized Randić index:

$$R_{\gamma }\left(H\right)=\sum _{xy\in E\left(H\right)}{\left(d\left(x\right)d\left(y\right)\right)}^{\gamma },$$

where $\gamma$ is any non-zero real number. For $\gamma =\frac{-1}{2}$, we obtain the famous Randić index, while for $\gamma =\frac{1}{2},1$ gives the reduced Randić and second Zagreb indices.

The historical and mathematical concepts of the above-discussed topological indices can be found in [3,4,5,6,7,8].

By replacing product with sum in the above expression, we obtain the general sum-connectivity index. The concept of general sum-connectivity index was put forward by Zhou et al. in [9] and is defined as

$${\chi }_{\gamma }\left(H\right)=\sum _{xy\in E\left(H\right)}{\left(d\left(x\right)+d\left(y\right)\right)}^{\gamma }.$$

From the above, the sum-connectivity index can be obtained by replacing $\gamma$ with $\frac{-1}{2}$. When $\gamma =1$, the expression is known as the first Zagreb index, while for $\gamma =2$, we obtain the hyper Zagreb index.

Studies on the general sum-connectivity, sum-connectivity, first Zagreb and hyper Zagreb indices have been conducted by many researchers [5,10,11,12,13].

A graph G is regular if the degree of each of its nodes is same; otherwise, it is irregular. In most problems and applications, it is of great interest to know the irregularity of H. The topological characterization of the irregularity of H is useful for investigating the structural properties of random and deterministic networks, as well as systems appearing in social and chemical structures and biology [14].

In 1991, Albertson [15] defined the irregularity of graph H as

$$Ir{r}_{Alb}\left(H\right)=\sum _{xy\in E\left(H\right)}|d\left(x\right)-d\left(y\right)|.$$

The above quantity is also named the Albertson index or third Zagreb index.

In [16], the authors proposed a similar kind of quantity (a forgotten topological index):

$$Ir{r}_{Alb2}\left(H\right)=\sum _{xy\in E\left(H\right)}{(d\left(x\right)-d\left(y\right))}^2.$$

Detailed studies on the above irregularities can be found in [17,18,19,20,21,22].

For a graph H of order $n\ge 2$, let $V_l$ be a set of words with a length of l letters from V, where l is a positive integer. The letters of a word $\mathbf{x}\in V_l$ are indexed by $x_1{x}_2\cdots x_l$. Klavžar [23] introduced the concept of Sierpiński graphs $S(K_n,l)$. Later, Gravier [24] generalized this concept for any graph G and named it the generalized Sierpiński graph $gS(G,l)$. Motived by the study of Gravier [24] and topological index work by Javed et al. [25], we consider the problem of irregularities and connectivity indices for generalized Sierpiński graphs $gS(G,l)$ and classify the extremal graphs for said invariants. In QSAR/QSPR studies, a TI (topological index) is a numeric entity associated with a chemical graph which can tell the specific physical and chemical properties of the corresponding molecule. In many problems and applications, it is interesting to know how irregular a graph can be. The generalized Sierpiński graph $gS(H,l)$ of H with dimension l is a graph of $V_l$ such that two words, $\mathbf{x}$ and $\mathbf{y}$, form an edge iff (if and only if) there exists $i\in \{1,\cdots ,l\}$, satisfying the following:

• $x_j=y_j$, if $j<i$.
• $x_i\ne y_i$ but $\{x_i,y_i\}\in E\left(H\right)$.
• $x_j=y_i$ and $y_j=x_i$, whenever $j>i$.

From the above, we note that if $\mathbf{xy}$$\in E\left(gS\right(H,l\left)\right)$, then there is $uv\in E\left(H\right)$ and a word $\mathbf{z}$ satisfying $\mathbf{x}$$=zuvv\cdots v$ and $\mathbf{y}$$=zvuu\cdots u$. A node of the representation $xx\cdots x$ is said to be an extreme node. For H and an integer $l\ge 2$, $gS(H,l)$ has n extreme nodes. Further, we have $d_H\left(x\right)=d_{gS(H,l)}(xx\cdots x)$, $d_H\left(x\right)+1=d_{gS(G,l)}yxx\cdots x$ and $d_H\left(y\right)+1=d_{gS(H,l)}xyy\cdots y$. Figure 1 and Figure 2 give $gS(H,l)$ and $gS(C_4,l)$, respectively.

Figure 1. Generalized Sierpiński Graphs $gS(H,1)$ and $gS(H,2)$.

Figure 2. Generalized Sierpiński Graphs $gS(C_4,1)$ and $gS(C_4,3)$.

From the construction, we have $\mathbf{x}\in V\left(gS\right(H,l\left)\right)$ and $d_{gS(H,l)}\left(\mathbf{x}\right)$$\in \{d_G\left(x\right),d_G\left(x\right)+1\}$, where $d_G\left(x\right)$ represents the degree of x in H. We follow the notations and terminologies of [26]. Let $|d_G\left(x\right),d_G{\left(y\right)|}_{gS\{H,l\}}$ be the number of copies $\{zxyy\cdots y,zyxx\cdots x\}$ of the edge $\{x,y\}$ whose endpoints have degrees $d_G\left(x\right)$ and $d_G\left(y\right)$ in $gS(H,l)$. For $x,y\in V\left(H\right)$, the number of $C_3$s in H with nodes x and y is denoted by $⊳(x,y)$, and $⊳\left(H\right)$ is the number of $C_3$s in H. For an arbitrary $\{x,y\}\in E\left(H\right)$, we see that $|N_G\left(x\right)\cap N_G\left(y\right)|=⊳(x,y)$, $|N_G\left(x\right)\cup N_G\left(y\right)|=d_H\left(x\right)+d_H\left(y\right)-⊳(x,y)$ and $|N_G\left(x\right)-N_G\left(y\right)|=d_G\left(x\right)-⊳(x,y)$. For H, we use the identity $1+n+n^2+\cdots +n^{l-1}=\frac{n^l-1}{n-1}$ and denote it as ${\xi }_n\left(l\right)$.

In [27], the authors used the concept of topological indices to describe the structure of polymers with optimal levels of macroscopic properties. Javed et al. [25] gave bounds on topological indices for generalized Sierpiński and extended Sierpiński graphs. In this article, we find the irregularity measures of a model of polymer networks based on $gS(H,l)$. Moreover, we present upper/lower bounds on the general sum-connectivity and general Randić indices for $gS(H,l)$ of any graph H. Our results are very general, and the bounds are sharp for large class of graphs. This study answers several questions and fills the gaps in previously published articles.

2. Discussion and Main Results

In this section, we calculate the irregularity of the generalized Sierpiński graph for any arbitrary graph G. Some sharp bounds are also presented as corollaries of the main result. Moreover, we present the bounds on general connectivity indices, such as the general sum-connectivity and general Randić indices, for the generalized Sierpiński graphs.

First, we mention an important lemma which we use to prove the main results.

Lemma 1

([26]). For a graph H of order n and an integer $l\ge 2$, the following holds for an arbitrary edge $xy$ of H.

1. 

${|d\left(x\right),d\left(y\right)|}_{gS(H,t)}=n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right)$.

2. 

${|d\left(x\right),d\left(y\right)+1|}_{gS(H,t)}=n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)$.

3. 

${|d\left(x\right)+1,d\left(y\right)|}_{gS(H,t)}=n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)$.

4. 

${|d\left(x\right)+1,d\left(y\right)+1|}_{gS(H,t)}=n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)$.

The first result is about the Albertson irregularity of the generalized Sierpiński graph of any graph and presents an explicit formula for it.

Theorem 1.

Let H be a graph. Then, the Albertson irregularity of the generalized Sierpiński graph $gS(H,l)$ with dimension $l\ge 2$ is

$$Ir{r}_{Alb}\left(gS(H,l)\right)=Ir{r}_{Alb}\left(H\right)({\xi }_n\left(l\right)+{\xi }_n(l-1))+2\omega ,$$

where

$$\omega =\sum _{\begin{array}{c}xy\in E\left(H\right)\\ d\left(x\right)=d\left(y\right)\end{array}}\left(n^{l-2}(d\left(x\right)-⊳(x,y))-{\xi }_n(l-2)·d\left(y\right)\right).$$

Proof. 

Let H be a graph with n nodes. The Albertson irregularity for the generalized Sierpiński graph of H, $gS(H,l)$ is given as

$$\begin{array}{cc}\hfill Ir{r}_{Alb}\left(gS(H,l)\right)& =\sum _{xy\in E\left(H\right)}\sum _{i,j=0,1}{|d\left(x\right)+i,d\left(y\right)+j|}_{gS(H,t)}|d\left(x\right)+i-(d\left(y\right)+j)|.\hfill \end{array}$$

From Lemma 1, we have

$$\begin{array}{cc}\hfill Ir{r}_{Alb}\left(gS(H,t)\right)& =\sum _{xy\in E\left(H\right)}[n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right)|d\left(x\right)-d\left(y\right)|\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)\right)|d\left(x\right)-(d\left(y\right)+1)|\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)\right)|(d\left(x\right)+1)-d\left(y\right)|\hfill \\ \hfill & +\left(n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)\right)\hfill \\ \hfill & \left|\right(d\left(x\right)+1)-(d\left(y\right)+1\left)\right|].\hfill \end{array}$$

Now, for each edge $xy$ of H, $\left|d\right(x)+i-d(y)-j|=\left(d\right(x)+i-d(y)-j)$ for $d\left(x\right)>d\left(y\right)$, where $0\le i,j\le 1$. For $d\left(x\right)=d\left(y\right)$, $\left|d\right(x)+i-d(y)-j|$ is either 0 or 1. So we have the following:

$$\begin{array}{cc}\hfill & =\sum _{xy\in E\left(H\right)}(d\left(x\right)-d\left(y\right))\left[n^{l-1}+n^{l-2}+{\xi }_n(l-2)+n^{l-2}+{\xi }_n(l-2)\right]\hfill \\ \hfill & +2\sum _{\begin{array}{c}xy\in E\left(H\right)\\ d\left(x\right)=d\left(y\right)\end{array}}\left[n^{l-2}(d\left(x\right)-⊳(x,y))-{\xi }_n(l-2)d\left(x\right)\right]\hfill \\ \hfill & =Ir{r}_{Alb}\left(gS(H,l)\right)\left({\xi }_n\left(l\right)+{\xi }_n(l-1)\right)\hfill \\ \hfill & +2\sum _{\begin{array}{c}xy\in E\left(H\right)\\ d\left(x\right)=d\left(y\right)\end{array}}\left[n^{l-2}(d\left(x\right)-⊳(x,y))-{\xi }_n(l-2)d\left(x\right)\right],\hfill \end{array}$$

which is the required result. □

The importance of the above results lies in the closed formulae for the Albertson irregularity of the generalized Sierpiński graph of an arbitrary graph. The following are its consequences.

Corollary 1.

For a tree T, the generalized Sierpiński graph $gS(T,l)$ satisfies

$$2(n-3)\left(n^{l-2}{\xi }_n(l-2)\right)\le Ir{r}_{Alb}\left(gS(H,l)\right)\le (n-1)(n-2)\left({\xi }_n\left(l\right)+{\xi }_n(l-1)\right).$$

The lower equality is achieved iff $T=P_n$ and the upper is achieved iff $T=S_n$.

The following result tells us that the Albertson irregularity-2 of the generalized Sierpiński graph of H depends on the Alberston irregularity-2 and the first Zagreb index of H.

Theorem 2.

Let H be a graph and $gS(H,l)$ with $l\ge 2$ be the generalized Sierpiński graph of H. Then, the Albertson-2 irregularity of $gS(H,l)$ is given as follows:

$$Ir{r}_{Alb2}\left(gS(H,l)\right)=Ir{r}_{Alb2}\left(H\right)\left({\xi }_n\left(l\right)+2{\xi }_n(l-1)\right)+\left({\xi }_n(l-1)\right)M_1\left(G\right)-2n^{l-2}\sum _{xy\in E\left(H\right)}⊳(x,y).$$

Proof. 

Let H be a graph with n nodes. The Albertson irregularity-2 for the generalized Sierpiński graph of H, $gS(H,l)$ can be given as follows:

$$\begin{array}{cc}\hfill Ir{r}_{Alb2}\left(gS(H,l)\right)& =\sum _{xy\in E\left(H\right)}\sum _{i,j=0,1}{|d\left(x\right)+i,d\left(y\right)+j|}_{gS(H,t)}{\left(d\left(x\right)+i-\left(d\right(y)+j)\right)}^2\hfill \end{array}$$

From Lemma 1, we have

$$\begin{array}{cc}\hfill & Ir{r}_{Alb2}\left(gS(H,t)\right)=\sum _{xy\in E\left(H\right)}[n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right){\left(d\left(x\right)-d\left(y\right)\right)}^2\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)\right){\left(d\left(x\right)-\left(d\right(y)+1)\right)}^2\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)\right){\left(\left(d\right(x)+1)-d\left(y\right)\right)}^2\hfill \\ \hfill & +\left(n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)\right){\left(\left(d\right(x)+1)-\left(d\right(y)+1)\right)}^2]\hfill \\ \hfill & =\sum _{xy\in E\left(H\right)}{\left[\right(d\left(x\right)-d\left(y\right))}^2\left(n^{l-1}+n^{l-2}+{\xi }_n(l-2)\right)+\left(n^{l-2}-{\xi }_n(l-2)\right)(d\left(x\right)+d\left(y\right))\hfill \\ & -2n^{l-2}⊳(x,y)+2{(d\left(x\right)-d\left(y\right))}^2(n^{l-2}+{\xi }_n(l-2))]\hfill \\ \hfill & =Ir{r}_{Alb2}\left(H\right)\left({\xi }_n\left(l\right)+{\xi }_n(l-1)+n^{l-2}\right)+\left(n^{l-2}-{\xi }_n(l-2)\right)M_1\left(H\right)\hfill \\ \hfill & -2n^{l-2}\sum _{xy\in E\left(H\right)}⊳(x,y).\hfill \end{array}$$

□

Corollary 2.

Let T be any tree. Then, for a given generalized Sierpiński graph $gS(T,l)$, we have

$$\begin{array}{cc}\hfill & 2{\xi }_n\left(l\right)-{\xi }_n(l-1)(6n-10)+6(n-1)n^{l-2}\le Ir{r}_{Alb2}\left(gS(H,l)\right)\le \hfill \\ & (n-1){(n-2)}^2{\xi }_n\left(l\right)+{\xi }_n(l-1)\left[2(n-1)(2n^2-7n+8)\right]+n(n-1)n^{l-2}.\hfill \end{array}$$

The lower bound achieves equality iff $T=P_n$, and the upper inequality achieves equality iff $T=S_n$.

Now, we will present some results related to the general connectivity indices.

Theorem 3.

Let H be a graph and $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, for $\gamma >0$, we have

$${\xi }_n\left(l\right)·{\chi }_{\gamma }\left(H\right)<{\chi }_{\gamma }\left(gS(H,l)\right)<{\xi }_n\left(l\right)·{\chi }_{\gamma }\left(H^1\right),$$

where $H^1$ is a graph obtained from H by adding one extra weight on each node of H, i.e., for every $x\in V\left(H\right)$, we have $d_{H^1}\left(x\right)=d_H\left(x\right)+1$.

Proof. 

Let $gS(H,l)$ be a generalized Sierpiński graph of a graph H with order n. The general sum-connectivity index for $gS(H,l)$ is given as

$$\begin{array}{cc}\hfill {\chi }_{\gamma }\left(gS(H,l)\right)& =\sum _{xy\in E\left(H\right)}\sum _{i,j=0,1}{|d\left(x\right)+i,d\left(y\right)+j|}_{gS(H,t)}{\left(d\left(x\right)+i+d\left(y\right)+j\right)}^{\gamma }.\hfill \end{array}$$

From Lemma 1, we have

$$\begin{array}{cc}\hfill & {\chi }_{\gamma }\left(gS(H,l)\right)=\sum _{xy\in E\left(H\right)}[n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right){\left(d\left(x\right)+d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)\right){\left(d\left(x\right)+\left(d\right(y)+1)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)\right){\left(\left(d\right(x)+1)+d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)\right)\left(\left(d\right(x)+1)+\left(d\right(y)\right){+1)}^{\gamma }]\hfill \\ \hfill & <\sum _{xy\in E\left(H\right)}{(d\left(x\right)+d\left(y\right)+2)}^{\gamma }\left[n^{l-1}+n^{l-2}+{\xi }_n(l-2)\right]\hfill \\ \hfill & ={\xi }_n\left(l\right)·{\chi }_{\gamma }\left(H^1\right).\hfill \end{array}$$

Now, for the lower bound, we have

$$\begin{array}{cc}\hfill & {\chi }_{\gamma }\left(gS(H,l)\right)>\sum _{xy\in E\left(H\right)}[n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right){\left(\left(d\right(x)+i)+\left(d\right(y)+j)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)\right){\left(d\left(x\right)+d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)\right){\left(d\left(x\right)+d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)\right)\left(d\left(x\right)+d\left(y\right)\right){)}^{\gamma }]\hfill \\ \hfill & =\sum _{xy\in E\left(H\right)}{(d\left(x\right)+d\left(y\right))}^{\gamma }\left[n^{l-1}+n^{l-2}+{\xi }_n(l-2)\right]\hfill \\ \hfill & ={\xi }_n\left(l\right)·{\chi }_{\gamma }\left(H\right),\hfill \end{array}$$

which is the required result. □

For $\gamma <0$, the inequalities in the above result become reverse. For $\gamma =1,2$, we have the following corollaries.

Corollary 3.

Let H be a graph and $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, for the first Zagreb index, we have

$${\xi }_n\left(l\right)·M_1\left(H\right)<M_1\left(gS(H,l)\right)<{\xi }_n\left(l\right)·M_1\left(H^1\right).$$

With the bound for the first Zagreb index for the trees, unicyclic graphs and bicyclic graphs for Zagreb indices of [6], we have the following consequence from Theorem 3.

Corollary 4.

Let T, U and B be a tree, a unicyclic and a bicyclic graph. Then, for $l\ge 2$, we have

$${\xi }_n\left(l\right)·2(n-3)<M_1\left(gS(T,l)\right)<{\xi }_n\left(l\right)·(n^2+4n-4),$$

$${\xi }_n\left(l\right)·4n<M_1\left(gS(U,l)\right)<{\xi }_n\left(l\right)·(n^2+4n+6),$$

$${\xi }_n\left(l\right)·(4n+10)<M_1\left(gS(B,l)\right)<{\xi }_n\left(l\right)·(n^2+4n+18).$$

Corollary 5.

Let H be a graph and $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, for the first hyper Zagreb index, we have

$${\xi }_n\left(l\right)·H{M}_1\left(H\right)<H{M}_1\left(gS(H,l)\right)<{\xi }_n\left(l\right)·H{M}_1\left(H^1\right).$$

With the help of the results from [11] (see Theorems 6, 7 and 8), and Theorem 3, we have the following result.

Corollary 6.

Let $T,U$ and B be a tree, a unicyclic and a bicyclic graph, respectively, with n and $l\ge 2$. Then,

$${\xi }_n\left(l\right)·2(8n-15)<H{M}_1\left(gS(T,l)\right)<{\xi }_n\left(l\right)·(n-1){(n+2)}^2,$$

$${\xi }_n\left(l\right)·16n<H{M}_1\left(gS(U,l)\right)<{\xi }_n\left(l\right)·(3n^2+16n+58),$$

$${\xi }_n\left(l\right)·2(8n+35)<H{M}_1\left(gS(B,l)\right)<{\xi }_n\left(l\right)·(n^3+3n^2+8n+116).$$

For $\gamma =\frac{-1}{2}$, we have the following results.

Corollary 7.

Let H be a graph and $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, for the sum-connectivity index, we have

$${\xi }_n\left(l\right)·{\chi }_{-\frac{1}{2}}\left(H\right)>{\chi }_{-\frac{1}{2}}gS(H,l)>{\xi }_n\left(l\right)·{\chi }_{-\frac{1}{2}}\left(H^1\right).$$

Using the extremal values for the general sum-connectivity and harmonic indices of the unicylic graph and bicyclic graphs from [10,28], the following result follows from the above corollary.

Corollary 8.

Let T be a tree, U be a unicyclic and B be a bicyclic graph of order n. Then,

$${\xi }_n\left(l\right)·\left(\frac{2}{\sqrt{3}}+\frac{(n-3)}{\sqrt{4}}\right)<{\chi }_{-\frac{1}{2}}gS(T,l)<{\xi }_n\left(l\right)·\frac{n-1}{\sqrt{n+2}},$$

$${\xi }_n\left(l\right)·\left(\frac{1}{\sqrt{6}}+\frac{2}{\sqrt{n+3}}+\frac{n-3}{\sqrt{n+2}}\right)<{\chi }_{-\frac{1}{2}}gS(U,l),$$

$${\chi }_{-\frac{1}{2}}gS(B,l)<{\xi }_n\left(l\right)·\left(\frac{n-4}{\sqrt{6}}+\frac{4}{\sqrt{7}}+\frac{1}{\sqrt{8}}\right).$$

In the following result, we present the lower/upper bounds on the general Randić index for $gS(H,l)$.

Theorem 4.

Let H be a graph and $gS(H,l)$ be the generalized Sierpiński graph of H for $l\ge 2$. Then, for $\gamma >0$, the general Randić index has the following bounds:

$${\xi }_n\left(l\right)·R_{\gamma }\left(H\right)<R_{\gamma }\left(gS(H,l)\right)<{\xi }_n\left(l\right)·R_{\gamma }\left(H^1\right)$$

where $H^1$ is a graph which is obtained from H by adding one extra weight on each node of H, i.e., for every $x\in V\left(H\right)$, we have $d_{H^1}\left(x\right)=d_H\left(x\right)+1$.

Proof. 

Let $gS(H,l)$ be the generalized Sierpiński graph of a graph H with order n. The general Randić index of $gS(H,l)$ can be written as

$$\begin{array}{cc}\hfill R_{\gamma }\left(gS(H,l)\right)& =\sum _{xy\in E\left(H\right)}\sum _{i,j=0,1}{|d\left(x\right)+i,d\left(y\right)+j|}_{gS(H,t)}{\left(\left(d\right(x)+i)·\left(d\right(y)+j)\right)}^{\gamma }.\hfill \end{array}$$

From Lemma 1, we have

$$\begin{array}{cc}\hfill & R_{\gamma }\left(gS(H,l)\right)=\sum _{xy\in E\left(H\right)}[n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right){\left(d\left(x\right)·d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)\right){\left(d\left(x\right)·\left(d\right(y)+1)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)\right){\left(\left(d\right(x)+1)·d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)\right)\left(\left(d\right(x)+1)·\left(d\right(y)\right){+1)}^{\gamma }]\hfill \\ \hfill & <\sum _{xy\in E\left(H\right)}{((d\left(x\right)+1)·(d\left(y\right)+1))}^{\gamma }\left[n^{l-1}+n^{l-2}+{\xi }_n(l-2)\right]\hfill \\ \hfill & ={\xi }_n\left(l\right)·R_{\gamma }\left(H^1\right).\hfill \end{array}$$

Now, for the lower bound,

$$\begin{array}{cc}\hfill R_{\gamma }\left(gS(H,l)\right)& =\sum _{xy\in E\left(H\right)}\sum _{i,j=0,1}{|d\left(x\right)+i,d\left(y\right)+j|}_{gS(H,t)}{\left(\left(d\right(x)+i)·\left(d\right(y)+j)\right)}^{\gamma }.\hfill \end{array}$$

From Lemma 1, we have

$$\begin{array}{cc}\hfill & R_{\gamma }\left(gS(H,l)\right)=\sum _{xy\in E\left(H\right)}[n^{l-2}\left(n-d\left(x\right)-d\left(y\right)+⊳(x,y)\right){\left(d\left(x\right)·d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(y\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(x\right)\right){\left(d\left(x\right)·\left(d\right(y)+1)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(d\left(x\right)-⊳(x,y)\right)-{\xi }_n(l-2)d\left(y\right)\right){\left(\left(d\right(x)+1)·d\left(y\right)\right)}^{\gamma }\hfill \\ \hfill & +\left(n^{l-2}\left(⊳(x,y)+1\right)+{\xi }_n(l-2)(d\left(x\right)+d\left(y\right)+1)\right)\left(\left(d\right(x)+1)·\left(d\right(y)\right){+1)}^{\gamma }]\hfill \\ \hfill & >\sum _{xy\in E\left(H\right)}{(d\left(x\right)·d\left(y\right))}^{\gamma }\left[n^{l-1}+n^{l-2}+{\xi }_n(l-2)\right]\hfill \\ \hfill & ={\xi }_n\left(l\right)·R_{\gamma }\left(H\right),\hfill \end{array}$$

which is the required result. □

The inequalities in the above result flip for $\gamma <0$.

The following results hold for $\gamma =\frac{1}{2},1$.

Corollary 9.

Let $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, the bounds of the reciprocal Randić index are as follows:

$${\xi }_n\left(l\right)·RR\left(H\right)<RR\left(gS(H,l)\right)<{\xi }_n\left(l\right)·RR\left(H^1\right).$$

Corollary 10.

Let $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, the second Zagreb index has the following bounds:

$${\xi }_n\left(l\right)·M_2\left(H\right)<M_2\left(gS(H,l)\right)<{\xi }_n\left(l\right)·M_2\left(H^1\right).$$

For $\gamma =\frac{-1}{2}$, we have the following:

Corollary 11.

Let $gS(H,l)$ be the generalized Sierpiński graph of H with $l\ge 2$. Then, the Randić index has the following bounds:

$${\xi }_n\left(l\right)·R\left(H\right)>R\left(gS(H,l)\right)>{\xi }_n\left(l\right)·R\left(H^1\right)$$

With values for the smallest general Randić index for trees from [29], the above corollary implies the following consequence.

Corollary 12.

Let $gS(T,l)$ be the generalized Sierpiński graph of T with $l\ge 2$. The Randić index has the bounds

$${\xi }_n\left(l\right)·\left(\frac{n-1}{\sqrt{2n}}\right)<R\left(gS(T,l)\right)<{\xi }_n\left(l\right)·\left(\frac{n-3}{2}+\sqrt{2}\right),$$

$${\xi }_n\left(l\right)·\left(2\sqrt{3}+2(n-3)\right)<RR\left(gS(T,l)\right)<{\xi }_n\left(l\right)·\left((n-1)\sqrt{n+2}\right),$$

$${\xi }_n\left(l\right)·\left(4(n-2)\right)<M_2\left(gS(T,l)\right)<{\xi }_n\left(l\right)·\left(4n^2(n-1))\right).$$

Finally for the general Randić index and $M_2$ from [30], we have the following immediate consequence of the above result.

Corollary 13.

Let U be a unicyclic graph and $gS(U,l)$ be the generalized Sierpiński graph of U for $l\ge 2$. Then, we have

$${\xi }_n\left(l\right)·4n<M_2\left(gS(U,l)\right)<{\xi }_n\left(l\right)·\left(2n^2+9\right),$$

$${\xi }_n\left(l\right)·16n<RR\left(gS(U,l)\right)<{\xi }_n\left(l\right)·\left((n-3)\sqrt{2n}+2\sqrt{3n}+3\right),$$

$${\xi }_n\left(l\right)·\left(\frac{1}{3}+\frac{2}{\sqrt{3n}}+\frac{n-3}{\sqrt{2n}}\right)<R\left(gS(U,l)\right)<{\xi }_n\left(l\right)·\left(\frac{n}{2}\right).$$