On Lanzhou Index of Graphs

Source abstract

Let G = ( V , E ) be a simple graph with vertex set V ( G ) and edge set E ( G ) . The Lanzhou index of a graph G is defined by L z ( G ) = ∑ u ∈ V ( G ) d 2 u ¯¯¯ d u , where d u ( ¯¯¯ d u resp.) denotes the degree of the vertex u in G ( ¯¯¯¯ G , the complement graph of G resp.). It has predictive powers to provide insights of chemical relevant properties of chemical graph structures. In this paper we discuss some properties of Lanzhou index. Several inequalities having lower and upper bound for the Lanzhou index in terms of first, second and third Zagreb indices, radius of graph, eccentric connectivity index, Schultz index, inverse sum indeg index and symmetric division deg index, are discussed. At the end the Lanzhou index of corona and join of graphs have been derived.