Background
Type: Article

Laplacian coefficients and Zagreb indices of trees

Journal: Linear and Multilinear Algebra (03081087)Year: 2 September 2019Volume: 67Issue: Pages: 1736 - 1749
Ashrafi A.R.Eliasi M.aGhalavand A.
DOI:10.1080/03081087.2018.1469599Language: English

Abstract

Let G be a simple and undirected graph with Laplacian polynomial ψ(G, λ) =∑nk=0 (− 1)n−k ck (G)λk. In earlier works, some formulas for computing c2(G), cn-2(G) and cn−3(G) 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 cn−4(T), where T is a tree. A lower and an upper bound for cn−4(T) are obtained. © 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group.