On the Lanzhou index of graphs

Authors

  • Chenxu Yang School of Computer, Qinghai Normal University, Xining, Qinghai 810008, China
  • Yaping Mao School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China https://orcid.org/0000-0001-9134-237X
  • Ivan Gutman Faculty of Science, University of Kragujevac, P. O. Box 60, Kragujevac, Serbia
  • Qinghe Tong School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China

DOI:

https://doi.org/10.13069/jacodesmath.v10i3.237

Keywords:

Lanzhou index, Degree, Topological indices

Abstract

Let $G$ be a simple graph with vertex set $V(G)$ and edge set $E(G)$. The Lanzhou index of a graph $G$ is defined as

${\rm Lz}(G)=\sum_{u\in V(G)}\,d_{\overline{G}}(v)\,d_G(v)^2$,

where $d_G(v)$ denotes the degree of the vertex $v$ in $G$. 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

Downloads

Download data is not yet available.

Downloads

Published

2023-09-02

How to Cite

Yang, C. ., Mao, Y., Gutman, I. ., & Tong, Q. . (2023). On the Lanzhou index of graphs. Journal of Algebra Combinatorics Discrete Structures and Applications, 10(3), 131–147. https://doi.org/10.13069/jacodesmath.v10i3.237

Issue

Section

Articles