Inverting graphs of rectangular matrices (Q797599): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3907599 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Consanguinity graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mechanical vibration trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3767385 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When is a Matrix Sign Stable? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of graphs of competition number m / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3222864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Qualitative Problems in Matrix Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorially symmetric matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sign solvable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3039403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3898496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of edge coverings by cliques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342712 / rank | |||
Normal rank |
Revision as of 12:38, 14 June 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