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

Tingzeng Wu | Zendy; Tian Zhou | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Tingzeng Wu,

Tian Zhou

Publication year - 2021

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2021/9161508

Subject(s) - combinatorics , laplacian matrix , mathematics , graph , laplace operator , discrete mathematics , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research