The permanent of the Laplacian matrix of a bipartite graph

DOI10.21136/cmj.1986.102059zbMath0603.05029OpenAlexW2512398716MaRDI QIDQ3739149

Antonin Vrba

Publication date: 1986

Full work available at URL: https://eudml.org/doc/13550

zbMATH Keywords

bipartite graphLaplacian matrixpermanent

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

On the geometry and Laplacian of a graph ⋮ Ordering trees by algebraic connectivity ⋮ Immanantal invariants of graphs

Cites Work

• Permanental polynomials of graphs
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian permanental polynomial for trees
• Subdeterminants and subgraphs
• An inequality for permanent of (0, 1)-matrices
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The permanent of the Laplacian matrix of a bipartite graph