Graphs determined by the (signless) Laplacian permanental polynomials
From MaRDI portal
Publication:5051488
DOI10.1080/03081087.2020.1849003OpenAlexW3106933751MaRDI QIDQ5051488
Publication date: 23 November 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2020.1849003
Laplacian matrixpermanentsignless Laplacian matrixLaplacian permanental polynomialsignless Laplacian permanental polynomial
Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- Per-spectral characterizations of graphs with extremal per-nullity
- Permanental bounds of the Laplacian matrix of trees with given domination number
- An efficient algorithm for computing permanental polynomials of graphs
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanental roots and the star degree of a graph
- A bound for the permanent of the Laplacian matrix
- Permanent of the Laplacian matrix of trees with a given matching
- Permanental polynomials of graphs
- Computing the permanental polynomials of graphs
- On the permanental polynomials of some graphs
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- On the characterizing properties of the permanental polynomials of graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Further results on permanental bounds for the Laplacian matrix of trees
- The Laplacian permanental polynomial for trees
- Characterizing properties of permanental polynomials of lollipop graphs
- Generalized Matrix Functions and the Graph Isomorphism Problem
This page was built for publication: Graphs determined by the (signless) Laplacian permanental polynomials