Processing math: 100%

Computing bounds for the general sum-connectivity index of some graph operations

S. Akhter, R. Farooq

Abstract


Let G be a graph with vertex set V(G) and edge set E(G). Denote by dG(u) the degree of a vertex uV(G). The general sum-connectivity index of G is defined as χα(G)=u1u2E(G)(dG(u1)+dG(u2))α, where α is a real number. In this paper, we compute the bounds for general sum-connectivity index of several graph operations. These operations include corona product, cartesian product, strong product, composition, join, disjunction and symmetric difference of graphs. We apply the obtained results to find the bounds for the general sum-connectivity index of some graphs of general interest.

Keywords


general sum-connectivity index, Randi\'c index, corona product, strong product, symmetric difference

Full Text:

PDF


DOI: http://dx.doi.org/10.12958/adm281

Refbacks

  • There are currently no refbacks.