Laplacian coefficients of unicyclic graphs with the number of leaves and girth

Jie Zhang, Xiao-Dong Zhang

Let $G$ be a graph of order $n$ and let $\mathcal{L}(G,\lambda )={\sum }_{k=0}^n(-1{)}^k{c}_k(G){\lambda }^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ilić and Ilić…