LAUSR

Let $G$ be a graph with $n$ vertices, and let $L\left(G\right)$ and $Q\left(G\right)$ denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of $G$ is defined as the permanent of the characteristic matrix of $L\left(G\right)$ (respectively, $Q\left(G\right)$ ). In this paper, we show that almost complete graphs are determined by their (signless) Laplacian permanental polynomials.