  The characteristic polynomials of the adjacency matrix of line graphs of
caterpillars and then the characteristic polynomials of their Laplacian or
signless Laplacian matrices are characterized, using recursive formulas.
Furthermore, the obtained results are applied on the determination of upper and
lower bounds on the algebraic connectivity of these graphs.
