Upper bounds on the harmonic status index (Q6618756)

Let \(G\) be a simple, connected, and finite graph. The status (also called transmission) \(\sigma_G(u)\) of a vertex \(u \in V(G)\) is the sum of the distance between \(u\) and all other vertices of \(G\). The harmonic status index of a graph \(G\) is\N\N\(\displaystyle HS(G) = \sum_{uv\in E(G)}\frac{2}{\sigma_G(u) + \sigma_G(v)}\).\N\NThe inverse status of a graph \(G\) is defined as \(\displaystyle \sigma^{-1}(G) = \sum_{u\in V(G)}\frac{1}{\sigma_G(u)}\).\N\NThe paper contains upper bounds on the harmonic status index of some families of graph operations (such as sum, disjunction, symmetric difference, Indu-Bala product, corona product, Cartesian product, lexicographic product, and strong product) in terms of certain structural invariants such as the order, size, maximum degree, inverse status and harmonic status index of their components.