Zero-one matrices with zero trace
From MaRDI portal
Publication:773068
DOI10.2140/pjm.1960.10.831zbMath0096.00703OpenAlexW2018850502MaRDI QIDQ773068
Publication date: 1960
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1960.10.831
Related Items
Directed Networks with a Differentially Private Bi-degree Sequence, The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Realizability and uniqueness in graphs, Leaf realization problem, caterpillar graphs and prefix normal words, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Binary vectors partially determined by linear equation systems, Simple existence conditions for zero-one matrices with at most one structural zero in each row and column, Tournaments, oriented graphs and football sequences, The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true, A note on the characterization of digraphic sequences, Directed star decompositions of the complete directed graph, Degree sequence for \(k\)-arc strongly connected multiple digraphs, Results on the small quasi-kernel conjecture, The k-factor conjecture is true, Sufficient Conditions for Graphicality of Bidegree Sequences, Graph realizations: maximum degree in vertex neighborhoods, Characterization of Digraphic Sequences with Strongly Connected Realizations, Matrices of zeros and ones with fixed row and column sum vectors, Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, Triangular (0,1)-matrices with prescribed row and column sums, Matrices of zeros and ones, Constructing and sampling directed graphs with given degree sequences, Efficiently Realizing Interval Sequences, A parameterized algorithmics framework for degree sequence completion problems in directed graphs, Exact sampling of graphs with prescribed degree correlations, Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros, A note on matrics with given diagonal entries, Integral matrices with given row and column sums, Enumeration and simulation methods for 0-1 matrices with given marginals, On the Swap-Distances of Different Realizations of a Graphical Degree Sequence, On the realization of a (p,s)-digraph with prescribed degrees, NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs, Bidimensional allocation of seats via zero-one matrices with given line sums, Dag Realizations of Directed Degree Sequences, Split digraphs, A study of the total chromatic number of equibipartite graphs, Relaxed and approximate graph realizations
