Inverting graphs of rectangular matrices

DOI10.1016/0166-218X(84)90123-9MaRDI QIDQ797599zbMATH OpenWikidataFDO

Authors Harvey J. Greenberg, J. Richard Lundgren, John S. Maybee

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(84)90123-9

zbMATH Keywords

clique cover graphrow graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Matrices of integers (15B36)

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.

Recommendations

• Inverting Signed Graphs
• scientific article; zbMATH DE number 3891428
• Graph invertibility
• Matrix inversion and digraphs: the one factor case
• On inverse M-matrices

Cites work

• A characterization of graphs of competition number m
• Applications of edge coverings by cliques
• Combinatorially symmetric matrices
• Consanguinity graphs
• Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
• scientific article; zbMATH DE number 3831999 (Why is no real title available?)
• scientific article; zbMATH DE number 3889550 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4025487 (Why is no real title available?)
• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Mechanical vibration trees
• Qualitative Problems in Matrix Theory
• Sign solvable graphs
• When is a Matrix Sign Stable?

Cited in

(16)

• A characterization of graphs of competition number m
• Matrices with a transitive graph and inverse M-matrices
• Niche graphs
• The \(m\)-step competition graph of a digraph
• Competition hypergraphs
• A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive
• Inversion of incidence mappings
• On \(m\)-step competition graphs of bipartite tournaments
• On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected
• scientific article; zbMATH DE number 3891428 (Why is no real title available?)
• Inverting Signed Graphs
• scientific article; zbMATH DE number 3991549 (Why is no real title available?)
• scientific article; zbMATH DE number 4114683 (Why is no real title available?)
• Two-step graphs of trees
• Applications of edge coverings by cliques
• Extensions of graph inversion to support an artificially intelligent modeling environment

This page was built for publication: Inverting graphs of rectangular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797599)