Hoffman program of Laplacian matching polynomials of graphs

Let G be the class of all connected simple graphs. The Hoffman program of graphs with respect to a spectral invariant λ(G) consists of determining all the limit points of the set {λ(G) | G ∈ G} and characterising all G’s such that λ(G) does not exceed a fixed limit point. In this paper, we study the Hoffman program for Laplacian matching polynomials of graphs in regard to their largest Laplacian matching roots. Precisely, we determine all the limit points of the largest Laplacian matching roots of graphs less than τ = 2 + ω1/2 + ω-1/2 (= 4.38+), and then characterise the connected graphs with the largest Laplacian matching roots less than 2 + √5, where (Formula Presented).