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...

A series of previously conducted experiments pertaining to various chemicals and drugs uncover a natural linkage between the molecular structures and the bio-medical and pharmacological characteristics. The forgotten topological index computed for the molecular structures of various chemical compounds and drugs has proven significant in medical and pharmaceutical fields by predicting biological...

In this paper, we extend the recently introduced vertex-degree-based topological index, Sombor and call it general index. The index generalizes both forgotten We present bounds in terms of other important graph parameters for also explore Nordhaus–Gaddum-type result further relations between generalized indices: Randić sum-connectivity

In this paper, we have been found the exact values of distance version Forgotten Topological index various types products such as strong, corona and tensor simple connected graphs. Also calculate product path, cycle complete

The forgotten topological index of a graph G is defined as the sum cube degrees its vertices. In this paper we establish eccentric complement line graphs and it denoted by . These are (v).e(v), where (edge vertex degree) some upper lower bounds for them.

Let G be a simple connected graph with n vertices and m edges and let d(e1) > d(e2) > · · · > d(em) be edge degree sequence of graph G. Denote by EF = ∑m i=1 d(ei) 3 reformulated forgotten index of G. Lower and upper bounds for the invariant EF are obtained.

<abstract><p>In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, get inequalities for these indices relating them with other indices: the first Zagreb index, forgotten index variable index. Finally, solve some extremal problems indices.</p></abstract>