## Abstract

The general sum-connectivity index χ_{α}( G) , for a (molecular) graph G, is defined as the sum of the weights (dG(a1)+dG(a2))α of all a_{1}a_{2}∈ E( G) , where d_{G}( a_{1}) (or d_{G}( a_{2}) ) denotes the degree of a vertex a_{1} (or a_{2}) in the graph G; E( G) denotes the set of edges of G, and α is an arbitrary real number. Eliasi and Taeri (Discrete Appl. Math. 157:794-803, 2009) introduced four new operations based on the graphs S( G) , R( G) , Q( G) , and T( G) , and they also computed the Wiener index of these graph operations in terms of W( F( G) ) and W( H) , where F is one of the symbols S, R, Q, T. The aim of this paper is to obtain sharp bounds on the general sum-connectivity index of the four operations on graphs.

Original language | English |
---|---|

Article number | 241 |

Journal | Journal of Inequalities and Applications |

Volume | 2016 |

Issue number | 1 |

DOIs | |

Publication status | Published - Dec 1 2016 |

## Keywords

- Cartesian product
- General sum-connectivity index
- Operation on graphs
- Total graph

## ASJC Scopus subject areas

- Analysis
- Discrete Mathematics and Combinatorics
- Applied Mathematics