Abstract

Every bipartite graph has a biclique comparability digraph whose vertices are the inclusion-maximal complete bipartite subgraphs of the bipartite graph and whose arcs correspond to inclusions of the relevant color classes. I characterize those digraphs that correspond to bipartite graphs and, in particular, those that correspond to chordal bipartite graphs.

This is motivated by work on finding the minimum rank of completions of partially specified matrices. In particular, Woerdeman (Integral Equations Operator Theory 10 (1987) 859) proved a formula for minimum rank in special cases that can be naturally reformulated in terms of the biclique comparability digraphs of the bipartite graphs that have the partial matrices as incidence matrices. Cohen et al. (Oper. Theory Adv. Appl. 40 (1989) 165) conjecture that this formula actually gives the minimum rank if and only if the corresponding bipartite graph is chordal bipartite.

Keywords: Comparability graphs; Bipartite graphs; Chordal bipartite graphs; Minimum ranks; Partial matrices

Article Outline

0. Introduction

1. Biclique comparability graphs

2. Finding minimum ranks of partial matrices

References