The Characterizing Properties of (Signless) Laplacian Permanental Polynomials of Almost Complete Graphs

Tingzeng Wu, Tian Zhou and Barbara Martinucci

Journal of Mathematics, 2021, vol. 2021, 1-7

Abstract: Let G be a graph with n vertices, and let LG and QG 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 LG (respectively, QG). In this paper, we show that almost complete graphs are determined by their (signless) Laplacian permanental polynomials.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/9161508.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/9161508.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:9161508

DOI: 10.1155/2021/9161508

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().