Pages that link to "Item:Q797599"
From MaRDI portal
The following pages link to Inverting graphs of rectangular matrices (Q797599):
Displaying 11 items.
- Two-step graphs of trees (Q688263) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Extensions of graph inversion to support an artificially intelligent modeling environment (Q918394) (← links)
- A characterization of graphs of competition number m (Q1055444) (← links)
- Niche graphs (Q1123204) (← links)
- The \(m\)-step competition graph of a digraph (Q1582072) (← links)
- Competition hypergraphs (Q1887068) (← links)
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive (Q1938687) (← links)
- On \(m\)-step competition graphs of bipartite tournaments (Q2192078) (← links)
- On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected (Q2448228) (← links)
- Inverting Signed Graphs (Q3703931) (← links)
