Bounds on the first leap Zagreb index of trees
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 de...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Vasyl Stefanyk Precarpathian National University
2021-08-01
|
Series: | Karpatsʹkì Matematičnì Publìkacìï |
Subjects: | |
Online Access: | https://journals.pnu.edu.ua/index.php/cmp/article/view/4403 |
Summary: | 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. |
---|---|
ISSN: | 2075-9827 2313-0210 |