Affiliation:
1. School of Mathematics and Statistics, Qinghai Nationalities University, Xining, Qinghai 810007, China
Abstract
Let
be a graph with
vertices, and let
and
denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of
is defined as the permanent of the characteristic matrix of
(respectively,
). In this paper, we show that almost complete graphs are determined by their (signless) Laplacian permanental polynomials.
Funder
National Natural Science Foundation of China