The physical and structural properties of molecular structure or graph such as boiling point, melting point, surface tension, or solubility are studied using topological index (TI). Topological index is a mathematical formula that can be applied to any graph which models some molecular structures. The various operations play an important role in graph theory such as joining, union, intersection, products, and subdivision. In this paper, we computed the bounds for general Randic coindex of -sum graphs such as (-sum, -sum, -sum, and -sum) in the form of their factor graphs. At the end, results are illustrated by numerical table for the particular -sum graphs.

1. Introduction

Graph theory is playing an important role in various sciences particularly in computer science and mathematical chemistry. The branch of mathematics which combines chemistry and graph theory is called chemical graph theory. The molecular structure descriptors have been used for quantifying information on molecules. This relates to characterizing physico-chemical, toxicologic, pharmacologic, biological, and other properties of chemical compounds by utilizing topological index (TI). TI is a mathematical formula that can be applied to any graph which models some molecular structures. It is an efficient mathematical method in avoiding laboratory experiments and time consumption [1, 2].

Actually, various TIs are introduced in order to describe physical and chemical properties of molecules. These indices are divided into different classes, namely, degree-based, distance-based, and polynomial-based, but the degree-based class is studied more than others, see the latest survey [3]. In 1947, Wiener calculated the boiling point of paraffin using a degree-based TI, see [4]. Gutman and Trinajstic calculated total -electron energy of hydrocarbons using degree-based first and second Zagreb indices [5]. Li and Zheng provided the idea of first general Zagreb index (FGZI) [6].

The Randic index was proposed by Randic in 1975 and has been widely studied in different areas. Li and Shi [7] calculated the extremal values of Randic index and its higher-order, zeroth-order, and general form for the extremal graphs. Delorme et al. [8] proved a best-possible lower bound for triangle-free graph with minimum degree of graph and Gutman et al. [9] point out a hitherto unnoticed feature of a molecular graph for Randic index. Arizmendi and Arizmendi proved that graph energy is twice of the Randic index and investigated that the equality holds iff graph is the union of complete bipartite graphs [10]. Li and Yang calculated the bounds for graphs whose general Randic indices reach the maximum and minimum [11]. Furtula and Gutman calculated Randic energy value of the connected graph with a fixed number of vertices [12]. Gao and Lu calculated the sharp bounds for the unicyclic graphs [13] and Li et al. [14] computed the bounds for of chemical graphs for general Randic index.

Ma et al. [15] gave a brief review for the Randic from 1975 to date such as zeroth-order Randic indices, sum-connectivity indices, geometric-arithmetic indices, Randic spectrum and energy, harmonic index, Randic matrix, D-L-S generalization, Balaban index, and atom-bond connectivity index. Milovanovic et al. [16] wrote a note and calculated some mathematical properties of the general zeroth-order Randic coindex of graphs in [17].

In the development of new graphs, the various operations play an important role in graph theory such as joining, union, intersection, products, and subdivision. Yan et al. [18] listed five different operations on a graph such as line graph , subdivided graph , line superposition graph , triangle parallel graph , and total graph , respectively; further, they computed Wiener index of these graphs. Eliasi and Taeri introduced the -sum graphs such as , where , and calculated the Wiener indices of graphs in [19]. Later on, many researchers worked on these -sum graphs such as Sarala et al. computed first and second Zagreb indices [20], Imran et al. [21] investigated the bounds of degree-based topological indices such as bounds of Zagreb indices, multiple Zagreb indices, the atom-bond connectivity (ABC) index, the forgotten topological index, the geometric-arithmetic (GA) index, and the Narumi-Katayama index, and Li et al. [22] computed bounds on general Randic indexes. Javaid et al. [23] calculated bounds for second Zagreb coindex, Akhter and Imran [24] calculated the forgotten topological index, Liu et al. [25] computing first general Zagreb index of operations on graphs, and Javaid et al. [26] calculated the Zagreb coindex and connection index of these graphs.

In this article, we investigated the sharp bounds for general Randic coindex of graphs that are obtained by using subdivisions related operations such as , , , and . The rest of the paper is organized as follows: Section 2 contains preliminaries and notations, Section 3 contains the main theorems of the work, and Section 4 contains conclusion of the work; further, the results are illustrated using examples for some particular -sum graphs.

2. Preliminaries

Let be nonempty set vertices and be the set of edges, then by combining both , a graph is formed that is denoted by . The cardinality of vertex set is called order of graph and cardinality of edge set is known as size of the graph which are denoted by and , respectively. Let , then its degree is denoted by and defined as number of edges incident on it. Let be a graph; its maximum and minimum degrees are denoted by and , respectively. For any graph , its complement is denoted by and defined as iff . Gutman and Trinajstic [5] introduced degree-based TIs known as Zagreb indices. Now, we define first and second Zagreb indices and coindices for any ,

Li and Zheng [6] introduced the first general Zagreb index that is defined as

By putting and , we obtained the first Zagreb index and forgotten index, respectively.

Zhou and Trinajstic [27] introduced the general sum-connectivity index (GSCI) denoted by after that general sum-connectivity coindex was introduced which is denoted by ; these are defined as

Bollobas and Erdos [28] introduced the concept of general Randic coindex denoted ; its coindex is denoted by which is defined as

The binomial and trinomial theorems are very important while expanding expression of those described aswhere .

Let be a graph, then is known as edge subdivision graph that is obtained inserting a vertex in each edge of , is called triangle parallel graph that is obtained from by joining an edge between the adjacent vertices of , is called superposition graph obtained from by joining an edge between the pairs of new vertices which are on the adjacent edges of , and is called total graph obtained by performing both operations of and on .

Let and be two simple connected graphs, then their graph with vertex set and iff and , and , where , For details, see Figures 1 and 2.

3. Main Results

This section contains results of the bounds for general Randic coindex.

Theorem 1. Let be an -sum graph, then its general Randic coindex is given aswhere

Proof. Using equation (4), we haveConsiderUsing equation (6),As we know, ,We obtained upper bound by putting value of , , and in equation (13). Similarly, lower bound can be obtained using smallest degree of graphs and .

Theorem 2. Let be a -sum graph, then its general Randic coindex is given as:where

Proof. Using equation (4), we haveThe value of follows from equation (11),