Some vertex/edge-degree-based topological indices of \(r\)-apex trees (Q2051642)

Summary: In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph \(G\), its vertex-degree-based topological indices of the form \(\mathrm{BID}(G)=\sum_{u v \in E(G)}\beta (d_u, d_v)\) are known as bond incident degree indices, where \(E(G)\) is the edge set of \(G\), \(d_w\) denotes degree of an arbitrary vertex \(w\) of \(G\), and \(\beta\) is a real-valued-symmetric function. Those BID indices for which \(\beta\) can be rewritten as a function of \(d_u + d_v - 2\) (that is degree of the edge \(uv\)) are known as edge-degree-based BID indices. A connected graph \(G\) is said to be \(r\)-apex tree if \(r\) is the smallest nonnegative integer for which there is a subset \(R\) of \(V(G)\) such that \(|R|=r\) and \(G-R\) is a tree. In this paper, we address the problem of determining graphs attaining the maximum or minimum value of an arbitrary BID index from the class of all \(r\)-apex trees of order \(n\), where \(r\) and \(n\) are fixed integers satisfying the inequalities \(n-r\geq2\) and \(r\geq1\).