Indexed metadata

On the Lanzhou index of graphs

Chenxu Yang, Yaping Mao, Ivan Gutman, Qinghe Tong

Source record

Source: Crossref

Published: Sep 2, 2023

DOI: 10.13069/jacodesmath.v10i3.237

Open original source ↗

Source abstract

Let GG be a simple graph with vertex set V(G)V(G) and edge set E(G)E(G). The Lanzhou index of a graph GG is defined as Lz(G)=∑u∈V(G) dG‾(v) dG(v)2{\rm Lz}(G)=\sum_{u\in V(G)}\,d_{\overline{G}}(v)\,d_G(v)^2, where dG(v)d_G(v) denotes the degree of the vertex vv in GG. In this paper, we determine extremal values of the Lanzhou index in terms of some graph parameters, as well as Nordhaus--Gaddum--type results. We also find relations between Lanzhou Index and other topological indices. Received: 25 January 2022 | Accepted: 7 March 2022

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On the Lanzhou index of graphs — Mathematical Frontier Network