Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs

Abstract

In this work, we study the degree-based topological invariants, and the general sum-connectivity, $AB{C}_4$, $G{A}_5$, general Zagreb, $GA$, generalized Randić, and $ABC$ indices of the line graphs of some rooted product graphs ($C_n\left\{P_k\right\}$ and $C_n\left\{S_{m+1}\right\}$) are determined by menas of the concept of subdivision. Moreover, we also computed all these indices of the line graphs of the subdivision graphs of i-th vertex rooted product graph $C_{i,r}\left\{P_{k+1}\right\}$.

1. Introduction

All graphs discussed in this paper are simple and connected. Let G be a (molecular) graph with vertex set $V\left(G\right)$ and edge set $E\left(G\right)$, respectively. For a vertex $u\in V\left(G\right)$, we denote $N_u=\{v:uv\in E\left(G\right)\}$, $d_u=\left|N_u\right|$ (degree of u) and $S_u={\sum }_{v\in N_u}{d}_v$. The subdivision of an edge $uv$ in a graph G is deduced by inserting a new vertex w in $V\left(G\right)$, and in edge set $E\left(G\right)$ the edge $uv$ is replaced by two new edges $uw$ and $wv$. In this way, the subdivision graph $S\left(G\right)$ results from the subdivision of all the edges of G. The line graph $L\left(G\right)$ of a graph G is the graph with $V\left(L\right(E\left)\right)=E\left(G\right)$, and $e_1{e}_2\in E\left(L\left(G\right)\right)$ if and only if $e_1$ and $e_2$ share a common endpoint in G. The $L\left(S\right(G\left)\right)$ is the line graph of $S\left(G\right)$.

The first degree-based topological index dates back to 1975, which is called the Randić index. The general Randić connectivity index [1] of graph G can be formulated by

$$R_{\alpha }\left(G\right)=\sum _{uv\in E\left(G\right)}{\left(d_u{d}_v\right)}^{\alpha },$$

(1)

where $\alpha \in R$ (in what follows, $\alpha$ always denoted as a real number), and $R_{-1/2}\left(G\right)$ is well known as Randić connectivity index of graph G.

Li and Zhao [2] introduced the first general Zagreb index which is stated as

$$M_{\alpha }\left(G\right)=\sum _{u\in V\left(G\right)}{\left(d_u\right)}^{\alpha }.$$

(2)

The general version of sum-connectivity index ${\chi }_{\alpha }\left(G\right)$ has been introduced in 2010 [3], which is defined as

$${\chi }_{\alpha }\left(G\right)=\sum _{uv\in E\left(G\right)}{(d_u+d_v)}^{\alpha }.$$

(3)

Estrada et al. [4] defined the atom-bond connectivity (ABC) index which was widely studied by researchers in the recent 10 years. For a graph G, its $ABC$ index is expressed by

$$ABC\left(G\right)=\sum _{uv\in E\left(G\right)}\sqrt{\frac{d_u+d_v-2}{d_u{d}_v}}.$$

(4)

The fourth $ABC$ index (denoted by $AB{C}_4$, as a neighborhood degree-based analog invariant) was introduced by Ghorbani et al. in [5], which is stated as

$$AB{C}_4\left(G\right)=\sum _{uv\in E\left(G\right)}\sqrt{\frac{S_u+S_v-2}{S_u{S}_v}}.$$

(5)

Vukicevic and Furtula [6] introduced the geometric arithmetic (GA) index and defined it as

$$GA\left(G\right)=\sum _{uv\in E\left(G\right)}\frac{2\sqrt{d_u{d}_v}}{d_u+d_v}.$$

(6)

A variant of GA index, the so-call the fifth $GA$ index $\left(G{A}_5\right)$, is proposed by Graovac et al. [7] as

$$G{A}_5\left(G\right)=\sum _{uv\in E\left(G\right)}\frac{2\sqrt{S_u{S}_v}}{S_u+S_v}.$$

(7)

For more recent contributions on the topological indices of graphs in different settings the readers may refer to [8,9,10,11,12,13,14,15,16,17,18,19,20].

Ranjini et al. [21] presented the exact values of the Shultz index of the subdivision graph of the wheel, tadpole, ladder, and helm graphs. The Zagreb indices of the line graph with subdivision of these structure are studied in [17]. In light of graph structure analysis, Su and Xu [22] computed the general sum-connectivity index and co-index of the line graph of these graphs with subdivision. Nadeem et al. [23] determined $AB{C}_4$ and $G{A}_5$ indices of the line graph of the wheel, ladder, and tadpole graphs by means of the definition of subdivision.

The strategies we used in our computations are: combinatorial registering, vertex partition procedure, edge partition technique, and degree-counting schemes. Furthermore, with the help of vertex and edge partitions, we compute various degree-based indices. In addition, we use Maple for calculations.

This paper is structured as follows. In next section, we yield a close formula of general Randić index, general sum connectivity index, general zagreb index, $ABC$, $AB{C}_4$, $GA$, and $G{A}_5$ indices for $L\left(S\right(G\left)\right)$, where G is certain rooted product graph. We define the i-th vertex rooted product of graphs and study the topological indices for $L\left(S\right(G\left)\right)$, where G is a family of i-th vertex rooted product of graphs in Section 3. Some remarks are presented in the concluding section.

2. Topological Indices of Line Graph of the Subdivision Graph of Rooted Product of Graphs

Let H be a labeled graph with vertex set $V\left(H\right)=\{1,2,\dots ,n\}$ and G be a sequence of n rooted graphs $G_1,G_2,\dots ,G_n$. Godsil and Mckay [24] defined the rooted product of H by G, i.e., $H\left(G\right)=H(G_1,G_2,\dots ,G_n)$ is a graph yielded by identifying the root vertex of $G_i$ with the i-th vertex of H for all $i\in \{1,2,\dots ,n\}$. In particular, if the components $G_i$ ($i\in \{1,2,\dots ,n\}$) are mutually isomorphic to K, then the rooted product of H by G is denoted by $H\left\{K\right\}$, which is the so-called cluster product of H by K.

2.1. Topological Indices of Line Graph of the Subdivision Graph of $C_n\left\{P_k\right\}$

Let $P_n$ and $C_n$ denotes the path and cycle with order n. Let $C_n\left\{P_{k+1}\right\}$ be the cluster product of cycle of length n with a path of length k. The graph of $C_n\left\{P_{k+1}\right\}$ is shown in Figure 1. It clearly shows that the number of vertices and number of edges in $C_n\left\{P_{k+1}\right\}$ are both $n+nk$. In the next theorem we will compute the general Zagreb index of the line graph of subdivision graph of $C_n\left\{P_{k+1}\right\}$.

Figure 1. The graph of $C_n\left\{P_k\right\}$; Line graph of the subdivision graph of $C_n\left\{P_k\right\}$.

Theorem 1.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_n\left\{P_{k+1}\right\}$. Then $M_{\alpha }\left(G\right)=n+(nk-n)2^{\alpha +1}+n·{\left(3\right)}^{\alpha +1}$.

Proof. 

The structure of G is shown in Figure 1. There are total $2n+2nk$ vertices among which the number of vertices of degree 1, 2, and 3 are n, $2nk-2n$, and $3n$, respectively. Thus, $M_{\alpha }\left(G\right)$ is obtained in terms of Equation (2). □

Theorem 2.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_n\left\{P_{k+1}\right\}$. Then

1.

$R_{\alpha }\left(G\right)=\left\{\begin{array}{cc}n·3^{\alpha }+4n·3^{2\alpha },\hfill & ifk=1;\hfill \\ n·2^{\alpha }+(2nk-3n)4^{\alpha }+n·6^{\alpha }+4n·3^{2\alpha },\hfill & ifk>1.\hfill \end{array}\right.$

2.

${\chi }_{\alpha }\left(G\right)=\left\{\begin{array}{cc}n·4^{\alpha }+4n·6^{\alpha },\hfill & ifk=1;\hfill \\ n·3^{\alpha }+(2nk-3n)4^{\alpha }+n·5^{\alpha }+4n·6^{\alpha },\hfill & ifk>1.\hfill \end{array}\right.$

3.

$ABC\left(G\right)=\left\{\begin{array}{cc}\left(\frac{1}{3}\sqrt{6}+\frac{8}{3}\right)n,\hfill & ifk=1;\hfill \\ \left(-\frac{\sqrt{2}}{2}+\frac{8}{3}\right)n+nk\sqrt{2},\hfill & ifk>1.\hfill \end{array}\right.$

4.

$GA\left(G\right)=\left\{\begin{array}{cc}\left(\frac{1}{2}\sqrt{3}+4\right)n,\hfill & ifk=1;\hfill \\ \left(\frac{2}{3}\sqrt{2}+1+\frac{2}{5}\sqrt{6}\right)n+2nk,\hfill & ifk>1.\hfill \end{array}\right.$

Proof. 

It is easily seen that $\left|E\right(G\left)\right|=3n+2kn$. The edge partitions, based on the degrees of the vertices for the cases $k=1$ and $k>1$, are shown in Table 1 and Table 2, respectively. In view of (1), (3), (4), and (6), we infer the required conclusions. □

Table 1. The edge partition of the graph G for $k=1$.

$(d_u,d_v)\mathrm{where}uv\in E\left(G\right)$	(1,3)	(3,3)
Number of edges	n	4n

Table 2. The edge partition of the graph G for $k>1$.

$(d_u,d_v)\mathrm{where}uv\in E\left(G\right)$	(1,2)	(2,2)	(2,3)	(3,3)
Number of edges	n	$2nk-3n$	n	$4n$

Theorem 3.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_n\left\{P_{k+1}\right\}$. Then

1.

$AB{C}_4\left(G\right)=$

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}\left(\frac{2}{21}\sqrt{42}+\frac{2}{3}\sqrt{2}+\frac{8}{9}\right)n,\hfill & ifk=1;\hfill \\ \left(\frac{1}{2}\sqrt{2}+\frac{1}{5}\sqrt{10}+\frac{1}{20}\sqrt{110}+\frac{1}{6}\sqrt{30}+\frac{8}{9}\right)n,\hfill & ifk=2;\hfill \\ \frac{1}{2}\sqrt{6}nk+n\left(\frac{1}{2}\sqrt{2}+\frac{1}{6}\sqrt{15}-\frac{5}{4}\sqrt{6}+\frac{8}{9}+\frac{1}{10}\sqrt{35}+\frac{1}{20}\sqrt{110}+\frac{1}{6}\sqrt{30}\right),\hfill & ifk>2.\hfill \end{array}\right.\end{array}$$

2.

$G{A}_5\left(G\right)=$

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}\left(\frac{1}{5}\sqrt{21}+\frac{3}{4}\sqrt{7}+2\right)n,\hfill & ifk=1;\hfill \\ \left(\frac{2}{5}\sqrt{6}+\frac{1}{4}\sqrt{15}+\frac{4}{13}\sqrt{10}+\frac{24}{17}\sqrt{2}+2\right)n,\hfill & ifk=2;\hfill \\ \left(\frac{2}{5}\sqrt{6}+\frac{4}{7}\sqrt{3}+\frac{24}{17}\sqrt{2}-3+\frac{4}{9}\sqrt{5}+\frac{4}{13}\sqrt{10}\right)n+2kn,\hfill & ifk>2.\hfill \end{array}\right.\end{array}$$

Proof. 

The edge partitions, according to the degree sum of neighbor vertices of every vertex for the cases $k=1$, $k=2$, and $k>2$, are shown in Table 3, Table 4 and Table 5, respectively. Using Equations (5) and (7), we obtain the required results. □

Table 3. The edge partition of the graph G for $k=1$.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	(3,7)	(7,9)	(9,9)
Number of edges	n	2n	2n

Table 4. The edge partition of the graph G for $k=2$.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	(2,3)	(3,5)	(5,8)	(8,9)	(9,9)
Number of edges	n	n	n	2n	2n

Table 5. The edge partition of the graph G for $k>2$.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	(2,3)	(3,4)	(4,4)	(4,5)	(5,8)	(8,9)	(9,9)
Number of edges	n	n	$2kn-5n$	n	n	2n	2n

2.2. Topological Indices of Line Graph of the Subdivision Graph of $C_n\left\{S_{m+1}\right\}$

Let $S_{m+1}$ be star graph on $m+2$ vertices. The cluster product of $C_n$ by $S_{m+1}$, denoted by $C_n\left\{S_{m+1}\right\}$, is obtained by identifying any pendent vertex of the i-th copy of $S_{m+1}$ to the i-th vertex of $C_n$. It is easy to see that there are $mn+2n$ vertices and edges in $C_n\left\{S_{m+1}\right\}$. The graph of $C_n\left\{S_{m+1}\right\}$ is shown in Figure 2.

Figure 2. The graph of $C_n\left\{S_{m+1}\right\}$; Line graph of the subdivision graph of $C_n\left\{S_{m+1}\right\}$.

Theorem 4.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_n\left\{S_{m+1}\right\}$. Then $M_{\alpha }\left(G\right)=mn+n·3^{\alpha +1}+n{(m+1)}^{\alpha +1}.$

Proof. 

The structure of G is manifested in Figure 2. There is a total $2mn+4n$ vertices among which the number of vertices with degree 1, 3, and $m+1$ are $mn$, $3n$, and $mn+n$, respectively. Thus, the expression of $M_{\alpha }\left(G\right)$ is deduced by means of (2). □

Theorem 5.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_n\left\{S_{m+1}\right\}$. Then

1.

$R_{\alpha }\left(G\right)=mn{(m+1)}^{\alpha }+n{(3m+3)}^{\alpha }+4n·9^{\alpha }+\frac{mn}{2}{(m+1)}^{2\alpha +1}.$

2.

${\chi }_{\alpha }\left(G\right)=mn{(m+2)}^{\alpha }+n{(m+4)}^{\alpha }+4n·6^{\alpha }+\frac{mn(m+1)}{2}{(2m+2)}^{\alpha }.$

3.

$ABC\left(G\right)=mn\sqrt{\frac{m}{m+1}}+\frac{n}{\sqrt{3}}\sqrt{\frac{2+m}{m+1}}+\frac{8n}{3}+\frac{mn\sqrt{m}}{\sqrt{2}}.$

4.

$GA\left(G\right)=\frac{2mn\sqrt{m+1}}{2+m}+\frac{2n\sqrt{3m+3}}{4+m}+4n+\frac{mn\left(m+1\right)}{2}.$

Proof. 

It is noted that there are $\frac{1}{2}(m^{2}n+3mn+10n)$ edges in G. Its edge partition, follow from the degrees of the vertices are depicted in Table 6. From (1), (3), (4), and (6), we get the required results. □

Table 6. The edge partition of the graph G.

$(d_u,d_v)\mathrm{where}uv\in E\left(G\right)$	(1, m + 1)	(3, m + 1)	(3,3)	(m + 1, m + 1)
Number of edges	$mn$	n	4n	$\frac{mn(m+1)}{2}$

Theorem 6.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_n\left\{S_{m+1}\right\}$ and let $\beta =m^2+m+1$. Then

1.

$AB{C}_4\left(G\right)=mn\sqrt{\frac{m-1+\beta }{\left(m+1\right)\beta }}+\frac{mn\left(m-1\right)\sqrt{2\beta -2}}{2\beta }+mn\sqrt{2}\sqrt{\frac{1}{\beta +2}}+n\sqrt{\frac{\beta +7+m}{\left(\beta +2\right)\left(m+7\right)}}+\frac{2n}{3}\sqrt{\frac{m+14}{m+7}}+\frac{8n}{9}.$

2.

$G{A}_5\left(G\right)=\frac{2mn\sqrt{\left(m+1\right)\beta }}{m+1+\beta }+\frac{mn\left(m-1\right)}{2}+\frac{2mn\sqrt{\beta \left(\beta +2\right)}}{2\beta +2}+\frac{2n\sqrt{\left(\beta +2\right)\left(m+7\right)}}{\beta +9+m}+\frac{12n\sqrt{m+7}}{m+16}+2n.$

Proof. 

The edge partitions, in light of the neighborhood analysis and degree calculation are presented in Table 7. From Equations (5) and (7), we obtain the required results. □

Table 7. The edge partition of the graph G.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	$(m+1,\beta )$	$(\beta ,\beta )$	$(\beta ,\beta +2)$	$(\beta +2,m+7)$	$(m+7,9)$	(9,9)
Number of edges	$mn$	$\frac{mn(m-1)}{2}$	$mn$	n	$2n$	$2n$

3. $\mathit{i}$-th Vertex Rooted Product of Graphs

Motivated by the definition of rooted product of graphs, we define the i-th vertex rooted product of graphs. Let H be a labeled graph with order n and G be a sequence of k rooted graphs $G_1,G_2,\dots ,G_k$. Then the i-th vertex rooted product of H by G, denoted by $H_i\{G_1,G_2,\dots ,G_k\}$ is generated by identifying the root vertex of every $G_l$ to the i-th vertex of H for all $l\in \{1,2,\dots ,k\}$. In the special case when the components $G_1,G_2,\dots ,G_k$ are mutually isomorphic to a graph L, the i-th vertex rooted product of H by G is denoted by $H_{i,k}\left\{L\right\}$ and so-called the i-th vertex cluster product of H by L.

Topological Indices of Line Graph of the Subdivision Graph of $C_{i,r}\left\{P_{k+1}\right\}$

Let $C=C_n$ be cycle on n vertices and let $C_{i,r}\left\{P_{k+1}\right\}$ be the i-th vertex cluster product of $C_n$ by $P_{k+1}$, where $P_{k+1}$ is a path on $k+1$ vertices. Obviously, there are $n+kr$ vertices and edges in $C_{i,r}\left\{P_{k+1}\right\}$. The graph of $C_{i,r}\left\{P_{k+1}\right\}$ is shown in Figure 3.

Figure 3. The graph of $C_{i,r}\left\{P_{k+1}\right\}$.

Theorem 7.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_{i,r}\left\{P_{k+1}\right\}$. Then $M_{\alpha }\left(G\right)=r+(n+kr-r-2)2^{\alpha +1}+{(r+2)}^{\alpha +1}$.

Proof. 

The basic structure of G is depicted in Figure 3. There are in total $2n+2kr$ vertices, among which r vertices meet degree 1, $2n+2kr-2r-2$ vertices have degree 2, and the remaining $r+2$ vertices satisfy degree $r+2$. Therefore, the fomula for $M_{\alpha }\left(G\right)$ is got in terms of (2). □

Theorem 8.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_{i,r}\left\{P_{k+1}\right\}$. Then

1.

$R_{\alpha }\left(G\right)$ =

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}r·{(r+2)}^{\alpha }+(2n-3)4^{\alpha }+2·{(2r+4)}^{\alpha }+\frac{1}{2}(r^2+3r+2){(r+2)}^{2\alpha },\hfill & ifk=1;\hfill \\ r·2^{\alpha }+(2n+2kr-3r-3)4^{\alpha }+(r+2){(2r+4)}^{\alpha }+\frac{1}{2}(r^2+3r+2){(r+2)}^{2\alpha },\hfill & ifk>1.\hfill \end{array}\right.\end{array}$$

2.

${\chi }_{\alpha }\left(G\right)=$

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}r·{(r+3)}^{\alpha }+(2n-3)4^{\alpha }+2·{(r+4)}^{\alpha }+\frac{1}{2}(r^2+3r+2){(2r+4)}^{\alpha },\hfill & ifk=1;\hfill \\ r·3^{\alpha }+(2n+2kr-3r-3)4^{\alpha }+(r+2){(r+4)}^{\alpha }+\frac{1}{2}(r^2+3r+2){(2r+4)}^{\alpha },\hfill & ifk>1.\hfill \end{array}\right.\end{array}$$

3.

$ABC\left(G\right)=\left\{\begin{array}{cc}r\sqrt{\frac{1+r}{r+2}}+\frac{1}{2}\left(2n-3\right)\sqrt{2}+\sqrt{2}+\frac{1}{2}\left(r+1\right)\sqrt{2r+2},\hfill & ifk=1;\hfill \\ \frac{r}{\sqrt{2}}+\frac{2kr+2n-3r-3}{\sqrt{2}}+\frac{r+2}{\sqrt{2}}+\frac{1}{2}\left(1+r\right)\sqrt{2r+2},\hfill & ifk>1.\hfill \end{array}\right.$

4.

$GA\left(G\right)=\left\{\begin{array}{cc}2\frac{r\sqrt{r+2}}{3+r}+2n-3+4\frac{\sqrt{2r+4}}{4+r}+\frac{\left(r^2+3r+2\right)}{2},\hfill & ifk=1;\hfill \\ \frac{2}{3}r\sqrt{2}+2kr+2n-3r-3+2\frac{\left(r+2\right)\sqrt{2r+4}}{4+r}+\frac{\left(r^2+3r+2\right)}{2},\hfill & ifk>1.\hfill \end{array}\right.$

Proof. 

By simple calculation the total number of edges of G are $\frac{1}{2}(4n+r^2+4kr+r)$. The edge partitions, using the degrees of the vertices for the cases $k=1$ and $k>1$, are shown in Table 8 and Table 9, respectively. Equations (1), (3), (4), and (6) implies the required results. □

Table 8. The edge partition of the graph G for $k=1$.

$(d_u,d_v)\mathrm{where}uv\in E\left(G\right)$	$(1,r+2)$	$(2,2)$	$(2,r+2)$	$(r+2,r+2)$
Number of edges	r	$2n-3$	2	$\frac{1}{2}(r^2+3r+2)$

Table 9. The edge partition of the graph G for $k>1$.

$(d_u,d_v)\mathrm{where}uv\in E\left(G\right)$	$(1,2)$	$(2,2)$	$(2,r+2)$	$(r+2,r+2)$
Number of edges	r	$2n+2kr-3r-3$	$r+2$	$\frac{1}{2}(r^2+3r+2)$

Theorem 9.

Let G be a graph isomorphic to the line graph of the subdivision graph of $C_{i,r}\left\{P_{k+1}\right\}$ and let $t=r^2+3r+3$. Then

1.

$AB{C}_4\left(G\right)=$

$$\begin{array}{c}\hfill \left\{\begin{array}{c}r\sqrt{\frac{r+t}{\left(r+2\right)t}}+\frac{1}{2}\left(r^2-r\right)\frac{\sqrt{2t-2}}{t}+2r\sqrt{\frac{2t-1}{t\left(t+1\right)}}+\frac{\sqrt{2t}}{t+1}+2\sqrt{\frac{r+3+t}{\left(r+4\right)\left(t+1\right)}}+\sqrt{\frac{6+r}{r+4}}+\hfill \\ \frac{1}{4}\left(2n-5\right)\sqrt{6},\hfill & ifk=1;\hfill \\ \frac{r}{\sqrt{2}}+\frac{r}{\sqrt{3}}\sqrt{\frac{r+5}{r+4}}+\sqrt{\frac{6+r}{r+4}}+\left(r+2\right)\sqrt{\frac{r+3+t}{\left(r+4\right)\left(t+1\right)}}+\frac{\left(t-1\right)\sqrt{t}}{\sqrt{2}\left(t+1\right)}+\hfill \\ \frac{1}{4}\left(2n-5\right)\sqrt{6},\hfill & ifk=2;\hfill \\ \frac{r}{\sqrt{2}}+\frac{1}{6}\sqrt{15}r+\frac{1}{2}\left(r+2\right)\sqrt{\frac{6+r}{r+4}}+\frac{\left(t-1\right)\sqrt{t}}{\sqrt{2}\left(t+1\right)}+\left(r+2\right)\sqrt{\frac{r+3+t}{\left(r+4\right)\left(t+1\right)}}+\hfill \\ \frac{1}{4}\left(2kr+2n-5r-5\right)\sqrt{6},\hfill & ifk>2.\hfill \end{array}\right.\end{array}$$

2.

$G{A}_5\left(G\right)=$

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}2\frac{r\sqrt{\left(r+2\right)t}}{r+2+t}+\frac{\left(r^2-r\right)}{2}+4\frac{r\sqrt{t\left(t+1\right)}}{2t+1}+4\frac{\sqrt{\left(r+4\right)\left(t+1\right)}}{r+5+t}+8\frac{\sqrt{r+4}}{8+r}+2n-4,\hfill & ifk=1;\hfill \\ \frac{2}{5}r\sqrt{6}+2\frac{r\sqrt{3r+12}}{7+r}+8\frac{\sqrt{r+4}}{8+r}+2\frac{\left(r+2\right)\sqrt{\left(r+4\right)\left(t+1\right)}}{r+5+t}+\frac{1}{2}t-\frac{11}{2}+2n,\hfill & ifk=2;\hfill \\ \frac{2}{5}r\sqrt{6}+\frac{4}{7}\sqrt{3}r+4\frac{\left(r+2\right)\sqrt{r+4}}{8+r}+\frac{1}{2}t-\frac{11}{2}+2\frac{\left(r+2\right)\sqrt{\left(r+4\right)\left(t+1\right)}}{r+5+t}+2kr+2n-5r,\hfill & ifk>2.\hfill \end{array}\right.\end{array}$$

Proof. 

For $t=r^2+3r+3$, the edge partitions, in view of neighborhood analysis and degree calculation of each vertex for the case $k=1$, $k=2$, and $k>2$, are shown in Table 10, Table 11 and Table 12, respectively. From Equations (5) and (7), we obtain the required results. □

Table 10. The edge partition of the graph G for $k=1$.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	$(r+2,t)$	$(t,t)$	$(t,t+1)$	$(t+1,t+1)$	$(r+4,t+1)$	$(4,r+4)$	$(4,4)$
Number of edges	r	$\frac{1}{2}(r^2-r)$	2r	1	2	2	$2n-5$

Table 11. The edge partition of the graph G for $k=2$.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	$(2,3)$	$(3,r+4)$	$(4,r+4)$	$(r+4,t+1)$	$(t+1,t+1)$	$(4,4)$
Number of edges	r	r	2	$r+2$	$\frac{1}{2}(t-1)$	$2n-5$

Table 12. The edge partition of the graph G for $k>2$.

$(S_u,S_v)\mathrm{where}uv\in E\left(G\right)$	$(4,r+4)$	$(t+1,t+1)$	$(r+4,t+1)$	$(2,3)$	$(3,4)$	$(4,4)$
Number of edges	$r+2$	$\frac{1}{2}(t-1)$	$r+2$	r	r	$2n-5+2kr-5r$

4. Conclusions

In this article, certain degree-based topological invariants, namely general sum-connectivity index, $AB{C}_4$, generalized Randić index, $G{A}_5$, and general Zagreb index for the line graphs of subdivision graphs of some classes of rooted product of graphs were studied for the first time. We have also constructed a new class of rooted product of graphs called i-th vertex rooted product of graph G by using the same concept of identifying the root vertex of sequence of graphs with the i-th vertex of G. Finally, in the last section we have computed the topological indices of the line graph of subdivision graph ith vertex cluster product of cycle of length r with path of length k.