Abstract
Let G be a simple and undirected graph with Laplacian polynomial . In earlier works, some formulas for computing
,
and
in terms of the number of vertices, the Wiener, the first Zagreb and the forgotten indices are given. In this paper, we continue this work by computing
, where T is a tree. A lower and an upper bound for
are obtained.
Keywords:
Notes
No potential conflict of interest was reported by the authors.