Some Results on Forgotten Topological Coindex

Abstract

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 inequalities for the forgotten topological coindex in terms of some graph parameters such as the order, size, number of pendent vertices, minimal and maximal vertex degrees, and minimal non-pendent vertex degree. We also study the relation between this invariant and some well-known graph invariants such as the Zagreb indices and coindices, multiplicative Zagreb indices and coindices, Zagreb eccentricity indices, eccentric connectivity index and coindex, and total eccentricity. Exact formulae for computing the forgotten topological coindex of double graphs and extended double cover of a given graph are also proposed.