Permanent of the Laplacian matrix of trees with a given matching

DOI10.1016/0012-365X(86)90091-9zbMath0653.05047MaRDI QIDQ1107543

John L. Goldwasser

Publication date: 1986

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

zbMATH Keywords

upper boundsbipartite graphadjacency matrixlower boundsLaplacian matrixpermanent

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Graphs determined by the (signless) Laplacian permanental polynomials ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Computing the permanental polynomials of graphs ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ Further results on permanental bounds for the Laplacian matrix of trees ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ Laplacian matrices of graphs: A survey

Cites Work

• Permanent of the Laplacian matrix of trees and bipartite graphs
• Permanental polynomials of graphs
• The Laplacian permanental polynomial for trees