Vertex-degree-based topological indices over trees with two branching vertices

ABSTRACT: Given a graph G with n vertices, a vertex-degree-based topological index is defined from a set of real numbers {φij} as T I (G) = Pmij (G) φij , where mij (G) is the number of edges between vertices of degree i and degree j, and the sum runs over all 1 ≤ i ≤ j ≤ n − 1. Let Ω (n, 2) denote...