We study eccentricity-based indices such as Zagreb eccentricity indices, general index and total index. present exact values of generalized networks related to binary $m$-ary trees, where $m \ge 2$.

The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...

In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.

We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), first Zagreb index (M 1), and Randić index (R -1).

In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...