Inverses of bipartite graphs

DOI10.1007/S00493-016-3502-YMaRDI QIDQ1715079zbMATH OpenOpenAlexFDO

Authors Yujun Yang, Dong Ye

Publication date 1 February 2019

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.06535

zbMATH Keywords

bipartite graphinverses of bipartite graphsMöbius functions of posets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Combinatorics of partially ordered sets (06A07)

Abstract: Let $G$ be a bipartite graph and its adjacency matrix $mathbbA$. If $G$ has a unique perfect matching, then $mathbbA$ has an inverse $mathbb{A}^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph. The inverses of bipartite graphs with unique perfect matchings have a strong connection to M"obius functions of posets. In this note, we characterize all bipartite graphs with a unique perfect matching whose adjacency matrices have inverses diagonally similar to non-negative matrices, which settles an open problem of Godsil on inverses of bipartite graphs in [Godsil, Inverses of Trees, Combinatorica 5 (1985) 33-39].

Recommendations

• Inverses of bicyclic graphs
• Inverses of trees
• Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
• On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
• Inverses of non-bipartite unicyclic graphs with a unique perfect matching

Cited in

(22)

• Inverting non-invertible labeled trees
• Partially ordering the class of invertible trees
• Group inverses of weighted trees
• Group inverses of a class of corona networks
• Inverse of \(\alpha\)-Hermitian adjacency matrix of a unicyclic bipartite graph
• scientific article; zbMATH DE number 4114683 (Why is no real title available?)
• On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
• On unimodular graphs
• Inverses of non-bipartite unicyclic graphs with a unique perfect matching
• Reverse binary graphs
• Generalized inverses in graph theory
• Strongly self-inverse weighted graphs
• On invertible non-bipartite unicyclic graphs with a unique perfect matching and their smallest positive eigenvalues
• Bipartite graphs and inverse sign patterns of strong sign-nonsingular matrices
• On some graphs which possess inverses
• On graphs with signed inverses
• Graph invertibility
• The bipartite Laplacian matrix of a nonsingular tree
• scientific article; zbMATH DE number 1750103 (Why is no real title available?)
• Distance spectrum, 1-factor and vertex-disjoint cycles
• A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
• Spectral radius and \([a,b]\)-factors in graphs

This page was built for publication: Inverses of bipartite graphs

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