Computing the permanent of the Laplacian matrices of nonbipartite graphs

DOI10.1155/2021/6621029zbMath1477.05104OpenAlexW3174550048MaRDI QIDQ2230052

Grace Kalaso, Xiaoxue Hu

Publication date: 17 September 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/6621029

Mathematics Subject Classification ID

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
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• The complexity of computing the permanent
• Laplace eigenvalues of graphs---a survey
• Permanent of the Laplacian matrix of trees and bipartite graphs
• A bound for the permanent of the Laplacian matrix
• Permanental polynomials of graphs
• Laplacian matrices of graphs: A survey
• On the permanent of certain \((0,1)\) Toeplitz matrices
• Permanental bounds for nonnegative matrices via decomposition
• Pólya's permanent problem
• The skew energy of a digraph
• Further results on permanental bounds for the Laplacian matrix of trees
• The Laplacian permanental polynomial for trees
• A survey of graph laplacians

This page was built for publication: Computing the permanent of the Laplacian matrices of nonbipartite graphs