Inverting graphs of rectangular matrices (Q797599): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587400 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Kim Hang Kim / rank | |||
Normal rank | |||
Revision as of 07:50, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverting graphs of rectangular matrices |
scientific article |
Statements
Inverting graphs of rectangular matrices (English)
0 references
1984
0 references
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.
0 references
clique cover graph
0 references
row graph
0 references
