Inverting graphs of rectangular matrices
From MaRDI portal
Publication:797599
DOI10.1016/0166-218X(84)90123-9zbMath0545.05060WikidataQ127176508 ScholiaQ127176508MaRDI QIDQ797599
John S. Maybee, Harvey J. Greenberg, J. Richard Lundgren
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Matrices of integers (15B36)
Related Items (11)
Inverting Signed Graphs ⋮ Competition hypergraphs ⋮ Niche graphs ⋮ On \(m\)-step competition graphs of bipartite tournaments ⋮ A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive ⋮ Extensions of graph inversion to support an artificially intelligent modeling environment ⋮ On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected ⋮ Two-step graphs of trees ⋮ Applications of edge coverings by cliques ⋮ The \(m\)-step competition graph of a digraph ⋮ A characterization of graphs of competition number m
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of edge coverings by cliques
- A characterization of graphs of competition number m
- Combinatorially symmetric matrices
- Sign solvable graphs
- Consanguinity graphs
- Mechanical vibration trees
- Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
- When is a Matrix Sign Stable?
- Qualitative Problems in Matrix Theory
This page was built for publication: Inverting graphs of rectangular matrices