On the Laplacian Coefficients of Tricyclic Graphs with Prescribed Matching Number
Let [...] φ(L(G))=det (xI−L(G))=∑k=0n(−1)kck(G)xn−k be the Laplacian characteristic polynomial of G. In this paper, we characterize the minimal graphs with the minimum Laplacian coefficients in n,n+2(i) (the set of all tricyclic graphs with fixed order n and matching number i). Furthermore, the graphs with the minimal Laplacian-like energy, which is the sum of square roots of all roots on ϕ(L(G)), is also determined in n,n+2(i).