Pages that link to "Item:Q4184870"
From MaRDI portal
The following pages link to Bigraphs versus digraphs via matrices (Q4184870):
Displayed 16 items.
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Bipartite graphs obtained from adjacency matrices of orientations of graphs (Q1117951) (← links)
- A characterization of particular symmetric (0,1) matrices (Q1123237) (← links)
- Linear operators that strongly preserve graphical properties of matrices (Q1196986) (← links)
- Representing branched coverings by edge-coloured graphs (Q1822800) (← links)
- Telegraph systems on networks and port-Hamiltonians. II: Network realizability (Q2135779) (← links)
- Stability of circulant graphs (Q2421553) (← links)
- Resilience to denial-of-service and integrity attacks: a structured systems approach (Q2667478) (← links)
- Markovian online matching algorithms on large bipartite random graphs (Q2684964) (← links)
- A minimal completion of (0, 1)-matrices without total support (Q4967247) (← links)
- Mittag--Leffler Functions and their Applications in Network Science (Q5014163) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- Sparsification of Binary CSPs (Q5220474) (← links)
- Non-Backtracking Alternating Walks (Q5231195) (← links)
- Sparsification of Two-Variable Valued Constraint Satisfaction Problems (Q5270406) (← links)
- Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs (Q6055929) (← links)