Inverting graphs of rectangular matrices (Q797599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inverting graphs of rectangular matrices |
scientific article; zbMATH DE number 3867389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverting graphs of rectangular matrices |
scientific article; zbMATH DE number 3867389 |
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
0.840194046497345
0 references
0.7579392790794373
0 references
0.7414378523826599
0 references
0.7398325204849243
0 references
