Bounds for the general sum-connectivity index of composite graphs

The general sum-connectivity index is a molecular descriptor defined as \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\chi_{\alpha}(X)=\sum_{xy\in E(X)}(d_{X}(x)+d_{X}(y))^{\alpha}$\end{document}χα(X)=∑xy∈E(X)(dX(x)+dX(y))α, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$d_{X}(x)$\end{document}dX(x) denotes the degree of a vertex \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$x\in X$\end{document}x∈X, and α is a real number. Let X be a graph; then let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$R(X)$\end{document}R(X) be the graph obtained from X by adding a new vertex \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$x_{e}$\end{document}xe corresponding to each edge of X and joining \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$x_{e}$\end{document}xe to the end vertices of the corresponding edge \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$e\in E(X)$\end{document}e∈E(X). In this paper we obtain the lower and upper bounds for the general sum-connectivity index of four types of graph operations involving R-graph. Additionally, we determine the bounds for the general sum-connectivity index of line graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$L(X)$\end{document}L(X) and rooted product of graphs.


Introduction
Topological indices are useful tools for theoretical chemistry. A structural formula of a chemical compound is represented by a molecular graph. The atoms of the compounds and chemical bonds represent the vertices and edges of the molecular graphs, respectively. Topological indices related to their use in quantitative structure-activity (QSAR) and structure-property (QSPR) relationships are very interesting. In the QSAR/QSPR study, physico-chemical properties and topological indices such as the Wiener index, the Szeged index, the Randić index, the Zagreb indices and the ABC index are used to predict the bioactivity of the chemical compounds.
A single number that characterizes some properties corresponding to a molecular graph represents a topological index. There are many classes of topological indices, some of them are distance-based topological indices, degree-based topological indices and counting related polynomials and indices of graphs. All topological indices are useful in different fields, but degree-based topological indices play an important role in chemical graph theory and particularly in theoretical chemistry.
In this paper, we consider simple, connected and finite graphs. Let X be a graph with vertex set V (X) and edge set E(X). For x ∈ V (X), N X (x) denotes the set of neighbors of x. The degree of a vertex x ∈ V (X) is the number of vertices adjacent to x and represented by d X (x) = N X (x). The numbers of vertices and number of edges in the graph X are represented by n X and m X , respectively. The maximum and minimum vertex degree of X are denoted by X and δ X , respectively.
The general Randić index of X was proposed by Bollobás and Erdős [], denoted by R α (X) and defined as follows: where α is a real number. Then R -  is the classical Randić index proposed by Randić [] in . Recently, a closely related topological index to the Randić index, called the sumconnectivity index [], denoted by χ(X), is as follows: Zhou and Trinajstić [] introduced the general sum-connectivity index, denoted by χ α (X) and defined as follows: where α is a real number. Then χ -  is the sum-connectivity index. Su and Xu [] introduced a new topological index, the general sum-connectivity co-index, denoted by χ α and is defined as follows: where α is a real number. Researchers introduced many graph operations such as the cartesian product, join of graphs, line graphs, the corona product, the edge corona product, the subdivision-vertex join, the subdivision edge join, the neighborhood corona, the subdivision vertex neighborhood corona and the subdivision edge neighborhood corona. Much work has been done related to these graph operations. Lan

Methods
In this paper, we obtain the lower and upper bounds for the general sum-connectivity index of four types of graph operations involving the R-graph. Additionally, we determine the bounds for the general sum-connectivity index of line graph L(X) and the rooted product of graphs by using graph-theoretic tools and mathematical inequalities.

Results and discussion
In this section, we derive some bounds on the general sum-connectivity index of several graph operations such as R-graphs, line graphs and the rooted product. Let X and Y be two simple connected graphs whose vertex sets are disjoint. For each x ∈ V (X) and y ∈ V (Y ), we have The equality holds if and only if X and Y are regular graphs.

R-graphs
Let X be a graph; then R(X) is the graph obtained from X by adding a new vertex x e corresponding to each edge of X and joining x e to the end vertices of the corresponding edge The corona product of two graphs X and Y , denoted by X • Y , is a graph obtained by taking one copy of graph X and n X copies of graph Y and joining the vertex X, that is, on the ith position in X to every vertex in ith copy of Y . The order and size of X • Y are n X ( + n Y ) and m X + n X m Y + n X n Y , respectively. The degree of a vertex x ∈ V (X • Y ) is given by Let X and Y be two connected and vertex-disjoint graphs. The R-vertex corona product of R(X) and Y , denoted by R(X) Y , is a graph obtained from one copy of vertex-disjoint graph R(X) and n X copies of Y and joining a vertex of V (X), that is, on the ith position in R(X) to every vertex in the ith copy of Y . The graph R(X) Y has a number of n X + m X + n X n Y vertices and m X + n X m Y + n X n Y edges. The degree of a vertex x ∈ V (R(X) Y ) is given by The R-edge corona product of R(X) and Y , denoted by R(X) Y , is a graph obtained from one copy of vertex-disjoint graph R(X) and m X copies of Y and joining a vertex of I(X), that is, on ith position in R(X) to every vertex in the ith copy of Y . The graph R(X) Y has n X + m X + m X n Y number of vertices and m X + m X m Y + m X n Y number of edges. The degree of a vertex x ∈ V (R(X) Y ) is given by The R-vertex neighborhood corona product of R(X) and Y , denoted by R(X) Y , is a graph obtained from one copy of vertex-disjoint graph R(X) and n X copies of Y and joining the neighbors of a vertex of X in R(X), that is, on the ith position in R(X) to every vertex in the ith copy of Y . The graph R(X) Y has n X + m X + n X n Y vertices and m X + n X m Y + m X n Y edges. The degrees of vertices of R(X) Y are given by The R-edge neighborhood corona product of R(X) and Y , denoted by R(X) Y , is a graph obtained from one copy of vertex-disjoint graph R(X) and m X copies of Y and joining the neighbors of a vertex of I(X) in R(X), that is, on the ith position in R(X) to every vertex in the ith copy of Y . The graph R(X) Y has n X + m X + m X n Y vertices and In the following theorem, we compute the bounds on the general sum-connectivity index of R-vertex corona product of R(X) and Y .
Theorem . Let α < . Then the bounds for the general sum-connectivity index of R(X) Y are given by The equality holds if and only if X and Y are regular graphs.
Proof Using (.) and (.) in equation (.), we get One can analogously compute the following: The equality in (.) and (.) obviously holds if and only if X and Y are regular graphs. This completes the proof.
We compute the bounds on the general sum-connectivity index for the R-edge corona product of R(X) and Y in the following theorem.

The equality holds if and only if X and Y are regular graphs.
Proof Using (.) and (.) in equation (.), we get Similarly, we can show that The equality in (.) and (.) obviously holds if and only if X and Y are regular graphs. This completes the proof.
In the following theorem, we calculate bounds on the general sum-connectivity index for the R-vertex neighborhood corona product of R(X) and Y .

The equality holds if and only if X and Y are regular graphs.
Proof Using (.) and (.) in equation (.), we get Similarly, we can show that The equality in (.) and (.) obviously holds if and only if X and Y are regular graphs. This completes the proof.
In the following theorem, we compute lower and upper bounds on the general sumconnectivity index for R-edge neighborhood corona product of R(X) and Y .
Theorem . Let α < . Then the bounds for the general sum-connectivity index of R(X) Y are given by The equality holds if and only if X and Y are regular graphs.
Proof Using (.) and (.) in equation (.), we get Analogously, one can compute the upper bound, The equality in (.) and (.) obviously holds if and only if X and Y are regular graphs. This completes the proof.

Line graph
The line graph of X, denoted by L(X), is a graph with vertex set V (L(X)) = E(X) and any two vertices e  and e  have an arc in L(X) if and only if they share a common endpoint in X.
The graph L(X) has m X vertices and   M  (X)m X edges. The degree of a vertex x ∈ L(X) is given by (.) We compute lower and upper bounds on the general sum-connectivity index of L(X) in the following theorem.
Theorem . Let α < . Then the bounds for the general sum-connectivity index of L(X) are given by The equality holds if and only if X is a regular graph.
Proof Using (.) and (.) in equation (.), we get One can analogously compute the following: The equality in (.) and (.) holds if and only if X is a regular graph.

Rooted product
A rooted graph is graph in which one vertex is labeled as a special vertex and that vertex is called root vertex of graph. The rooted graph is also known as a pointed graph and a flow graph. Let Y be a labeled graph with n Y and X be a sequence of n Y rooted graphs X  , X  , . . . , X n Y . The rooted product of X and Y , denoted by Y (X), is a graph that obtained from one copy of Y and n Y copies of X and identifying the rooted vertex of X i ( ≤ i ≤ n Y ) with ith vertex of Y . The number of vertices and edges in Y (X) are n X = n X  + n X  + · · · + n X n Y and m X + m Y . The degree of a vertex x ∈ V (Y (X)) (where w i is a rooted vertex of X i ) is given by In the following theorem, the bounds on the general sum-connectivity index of rooted product are computed.
Theorem . Let α < . Then the bounds for the general sum-connectivity index of Y (X) are given by

The equality holds if and only if Y and X i are regular graphs.
Proof Let the degree of w i in X i be denoted by ω i and the number of neighbors of w i in X i be denoted by |N X i (w i )|. Using (.) and (.) in equation (.), we get Similarly, we can show that The equality in (.) and (.) obviously holds if and only if Y and X i are regular graphs. This completes the proof.
In the special case, when all X  , X  , X  , . . . , X n Y are isomorphic to a graph G, then the rooted product of Y and G is denoted by Y {G}. This rooted product is called a cluster of Y and G. The following corollary is an easy consequence of Theorem ..
Corollary . Let α < . Then the bounds for the general sum-connectivity index of cluster Y {G} are given by where ω = d G (w) and |E(G)| = m Y .

Conclusion
In this article, we obtained the lower and upper bounds for the general sum-connectivity index of four types of graph operations involving R-graph. Additionally, we have deter-mined the bounds for the general sum-connectivity index of line graph L(X) and the rooted product of graphs.