Inverting graphs of rectangular matrices (Q797599): Difference between revisions

The authors study the question, for a graph G, when does there exist a matrix A such that there is an edge connecting i and j in G iff rows i and j of A have nonzero entry in the same column, and for two graphs, when can one be the row graph just defined and the other, the column graph of the same matrix, characterize the results by clique covers.