Abstract

Let G be a finite simple graph with Laplacian polynomial ψ G , λ = ∑ k = 0 n − 1 n − k c k λ k . In an earlier paper, the coefficients c n − 4 and c n − 5 for forests with respect to some degree-based graph invariants were computed. The aim of this paper is to continue this work by giving an exact formula for the coefficient c n − 6 .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call