Bigraphs versus digraphs via matrices
From MaRDI portal
Publication:4184870
Cites work
- A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
- Concerning nonnegative matrices and doubly stochastic matrices
- Connectivity and Reducibility of Graphs
- Coverings of Bipartite Graphs
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
Cited in
(20)- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Bipartite graphs obtained from adjacency matrices of orientations of graphs
- A characterization of particular symmetric (0,1) matrices
- Linear operators that strongly preserve graphical properties of matrices
- Representing branched coverings by edge-coloured graphs
- Telegraph systems on networks and port-Hamiltonians. II: Network realizability
- Stability of circulant graphs
- Resilience to denial-of-service and integrity attacks: a structured systems approach
- Markovian online matching algorithms on large bipartite random graphs
- A minimal completion of (0,1)-matrices without total support
- Mittag-Leffler functions and their applications in network science
- Sparsification of Binary CSPs
- Sparsification of binary CSPs
- Non-backtracking alternating walks
- Sparsification of two-variable valued constraint satisfaction problems
- Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs
- On graphs isomorphic with their conduction graph
- Connected components and non-bipartiteness of generalized Paley graphs
- Hermitian adjacency matrices with at most three distinct eigenvalues
- Additive sparsification of CSPs
This page was built for publication: Bigraphs versus digraphs via matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184870)
