Bigraphs versus digraphs via matrices

DOI10.1002/jgt.3190040107zbMath0401.05059OpenAlexW2008321530WikidataQ56209806 ScholiaQ56209806MaRDI QIDQ4184870

Zevi Miller, Richard A. Brualdi, Frank Harary

Publication date: 1980

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190040107

zbMATH Keywords

MatricesBigraphsStrongly ConnectedDigraphsAdjacency MatrixMatrix DecomposabilityMatrix ReducibilitySymmetric DigraphUnilaterally ConnectedWeakly Connected

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items

Telegraph systems on networks and port-Hamiltonians. II: Network realizability, Bipartite graphs obtained from adjacency matrices of orientations of graphs, A characterization of particular symmetric (0,1) matrices, Resilience to denial-of-service and integrity attacks: a structured systems approach, Sparsification of Binary CSPs, Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs, Stability of circulant graphs, Markovian online matching algorithms on large bipartite random graphs, Linear operators that strongly preserve graphical properties of matrices, A minimal completion of (0, 1)-matrices without total support, Sparsification of Binary CSPs, Non-Backtracking Alternating Walks, Representing branched coverings by edge-coloured graphs, Mittag--Leffler Functions and their Applications in Network Science, Combinatorial analysis (nonnegative matrices, algorithmic problems), Sparsification of Two-Variable Valued Constraint Satisfaction Problems

Cites Work

• Unnamed Item
• Concerning nonnegative matrices and doubly stochastic matrices
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• Coverings of Bipartite Graphs
• Connectivity and Reducibility of Graphs