  In this paper, we first give a necessary and sufficient condition for a graph
to have Laplacian pretty good pair state transfer. As an application of such
result, we give a complete characterization of Laplacian pretty good edge state
transfer in paths.
