On unimodular graphs with a unique perfect matching

DOI10.1016/j.dam.2023.12.008OpenAlexW4389635844MaRDI QIDQ6153471

Kuldeep Sarma, Parameswar Basumatary

Publication date: 14 February 2024

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

Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.008

zbMATH Keywords

adjacency matrixunicyclic graphbicyclic graphtricyclic graphunique perfect matchingunimodular graphpseudo-unimodular graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Graph invertibility and median eigenvalues
• Cauchy-Binet for pseudo-determinants
• The number of independent sets of tricyclic graphs
• On unimodular graphs
• A note on the total unimodularity of matrices
• Integral Boundary Points of Convex Polyhedra
• On some characterisations of totally unimodular matrices
• A sufficient condition for a matrix to be totally unimodular
• Inverses of non-bipartite unicyclic graphs with a unique perfect matching
• Characterization of Totally Unimodular Matrices
• Total Unimodularity of Matrices