Inverting graphs of rectangular matrices
type: Item
instance of: scholarly article
title: Inverting graphs of rectangular matrices
zbMATH Open document ID: 0545.05060
DOI: 10.1016/0166-218X(84)90123-9
author: Harvey J. Greenberg
author: J. Richard Lundgren
author: John S. Maybee
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15B36
zbMATH DE Number: 3867389
zbMATH Keywords: clique cover graph
zbMATH Keywords: row graph
reviewed by: Ki Hang Kim
MaRDI profile type: Publication
cites work: Q4770409
cites work: Q3907599
cites work: Consanguinity graphs
cites work: Mechanical vibration trees
cites work: Q3328583
cites work: Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
cites work: Q3767385
cites work: When is a Matrix Sign Stable?
cites work: A characterization of graphs of competition number m
cites work: Q3222864
cites work: Qualitative Problems in Matrix Theory
cites work: Combinatorially symmetric matrices
cites work: Sign solvable graphs
cites work: Q3039403
cites work: Q3898496
cites work: Applications of edge coverings by cliques
cites work: Q5342712
Wikidata QID: Q127176508
description: scientific article; zbMATH DE number 3867389