The Characterizing Properties of (Signless) Laplacian Permanental Polynomials of Almost Complete Graphs
Keyword(s):
Let G be a graph with n vertices, and let L G and Q G 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 G (respectively, Q G ). In this paper, we show that almost complete graphs are determined by their (signless) Laplacian permanental polynomials.
2016 ◽
Vol 5
(2)
◽
pp. 132
Keyword(s):
2020 ◽
Vol 12
(Issue 4)
◽
pp. 468-473
2018 ◽
Vol 34
◽
pp. 191-204
◽
2011 ◽
Vol 03
(02)
◽
pp. 185-191
◽