Almost complete graphs determined by Laplacian hook immanantal polynomials

Shuaijun Li, Guangfu Wang

Let \(\mathscr{G}_n\) be the family of simple graphs obtained from \(K_n\) by deleting at most five edges. For a fixed integer \(1\leq k\leq n\), let \(Φ_k(L(G),x)\) denote the im…