The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
From MaRDI portal
Publication:2052128
DOI10.1155/2021/9161508zbMath1477.05116OpenAlexW3203776071MaRDI QIDQ2052128
Publication date: 25 November 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/9161508
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral characterizations of almost complete graphs
- Permanental bounds of the Laplacian matrix of trees with given domination number
- The complexity of computing the permanent
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanental roots and the star degree of a graph
- Developments on spectral characterizations of graphs
- Permanental polynomials of graphs
- Which graphs are determined by their spectrum?
- Computing the permanental polynomials of graphs
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- On the (signless) Laplacian permanental polynomials of graphs
- Permanental sums of graphs of extreme sizes
- \( A_\alpha\)-spectral characterizations of some joins
- On the normalized Laplacian permanental polynomial of a graph
- Graph Polynomials
- 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
- Laplacian Permanents of Trees
- The Laplacian permanental polynomial for trees
This page was built for publication: The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs