The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs |
scientific article |
Statements
The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (English)
0 references
25 November 2021
0 references
Summary: 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.
0 references
0 references
0 references
