Bounds on the first leap Zagreb index of trees

Array

Authors

  • N. Dehgardi Sirjan University of Technology, Sirjan, Iran
  • H. Aram Gareziaeddin Center, Khoy Branch, Islamic Azad University, Khoy, Iran

DOI:

https://doi.org/10.15330/cmp.13.2.377-385

Keywords:

tree, first leap Zagreb index, Zagreb index

Abstract

The first leap Zagreb index $LM1(G)$ of a graph $G$ is the sum of the squares of its second vertex degrees, that is, $LM_1(G)=\sum_{v\in V(G)}d_2(v/G)^2$, where $d_2(v/G)$ is the number of second neighbors of $v$ in $G$. In this paper, we obtain bounds for the first leap Zagreb index of trees and determine the extremal trees achieving these bounds.

Downloads

Additional Files

Published

2021-08-19

How to Cite

(1)
Dehgardi, N.; Aram, H. Bounds on the First Leap Zagreb Index of Trees: Array. Carpathian Math. Publ. 2021, 13, 377-385.

Issue

Section

Scientific articles