On unimodular graphs with a unique perfect matching

DOI10.1016/J.DAM.2023.12.008OpenAlexW4389635844MaRDI QIDQ6153471FDOQ6153471

Authors: Parameswar Basumatary, Kuldeep Sarma 

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph invertibility and median eigenvalues
• Cauchy-Binet for pseudo-determinants
• Characterization of Totally Unimodular Matrices
• On unimodular graphs
• The number of independent sets of tricyclic graphs
• A sufficient condition for a matrix to be totally unimodular
• Integral boundary points of convex polyhedra
• A note on the total unimodularity of matrices
• Total Unimodularity of Matrices
• On some characterisations of totally unimodular matrices
• Inverses of non-bipartite unicyclic graphs with a unique perfect matching

This page was built for publication: On unimodular graphs with a unique perfect matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153471)