On the determinant of bipartite graphs

DOI10.1016/j.disc.2013.07.006zbMath1279.05044OpenAlexW2001348807MaRDI QIDQ389461

Khodakhast Bibak

Publication date: 20 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.006

zbMATH Keywords

bipartite graphdeterminantperfect matchingperfect 2-matching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On characteristic and permanent polynomials of a matrix ⋮ Complete (2,2) Bipartite Graphs ⋮ Parameterized complexity of determinant and permanent ⋮ Permanent, determinant, and rank of bi-block graphs

Cites Work

• Determinants of grids, tori, cylinders and Möbius ladders
• Determinants of box products of paths
• The problem of singularity for planar grids
• Spektren endlicher Grafen
• The minimum rank of symmetric matrices described by a graph: a survey
• Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids
• A characterization of singular graphs
• The Factorization of Linear Graphs
• Distinct representatives of subsets
• The 1-Factors of Oriented Graphs
• On the nullity of bipartite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the determinant of bipartite graphs