Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching

DOI10.1007/BF02122687zbMath0688.05056OpenAlexW2038143369MaRDI QIDQ1263603

Dasong Cao, Rodica Simion

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02122687

zbMATH Keywords

adjacency matrixbipartite graphsunique perfect matching

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Unnamed Item ⋮ Graph invertibility and median eigenvalues ⋮ On unimodular graphs ⋮ Inverses of weighted graphs ⋮ Self-inverse unicyclic graphs and strong reciprocal eigenvalue property ⋮ Inverses of triangular matrices and bipartite graphs ⋮ Partially ordering the class of invertible trees ⋮ Spectra of coronae ⋮ On some graphs which satisfy reciprocal eigenvalue properties ⋮ Strongly self-dual graphs ⋮ Graph invertibility ⋮ Directed intervals and the dual of a graph ⋮ Almost self-inverse graphs

Cites Work

• Unnamed Item
• Inverses of trees
• Trees with 1-factors and oriented trees