Skip to the main content

Rad Hrvatske akademije znanosti i umjetnosti. Matematičke znanosti, No. 542=24, 2020.

Original scientific paper

https://doi.org/10.21857/m16wjcev89

Laplacian coefficients of trees

Ali Ghalavand orcid id orcid.org/0000-0002-2858-0663 ; Department of Pure Mathematics, Faculty of Mathematical Sciences University of Kashan, Kashan 87317-53153, I. R. Iran
Ali Reza Ashrafi ; Department of Pure Mathematics, Faculty of Mathematical Sciences University of Kashan, Kashan 87317-53153, I. R. Iran

Full text: english pdf 511 Kb

page 1-14

downloads: 565

cite

Abstract

Let G be a simple and undirected graph with Laplacian polynomial ψ(G, λ) = Σk=0n (−1)n-kck(G)λk. In this paper, exact formulas for the coefficient cn−4 and the number of 4-matchings with respect to the Zagreb indices of a given tree are presented. The chemical trees with first through the fifteenth greatest cn−4-values are also determined.

Keywords

Laplacian coefficient; matching; Zagreb index; tree.

Hrčak ID:

243387

URI

https://hrcak.srce.hr/243387

Publication date:

15.9.2020.

Visits: 1.342 *