Combinatorial Properties of Matrices of Zeros and Ones

1957/01/01 by H. J. Ryser · 6 citations
Engineering · Computer Science · #graph theory and CDMA systems #Digital Image Processing Techniques #Graph Labeling and Dimension Problems

paper · pdf · doi:10.4153/cjm-1957-044-3

Abstract

This paper is concerned with a matrix A of m rows and n columns, all of whose entries are 0's and l's. Let the sum of row i of A be denoted by r i (i = 1, … , m ) and let the sum of column i of A be denoted by s i ( i = 1, … , n ).

Cited by

• Configuring Random Graph Models with Fixed Degree Sequences
• Interchange graphs of (0,1)-matrices are maximally Hamiltonian
• The realization graph of every degree sequence has a Hamilton path
• Relaxation-based dynamical Ising machines for discrete tomography
• Efficient Generation of Binary Magic Squares
• Degree Realization by Bipartite Cactus Graphs

Related

• Sums and products of square-zero matrices
• On finding a particular class of combinatorial identities
• Combinatorial Proofs of Identities Involving Symmetric Matrices
• Counting binary matrices with given row and column sums
• Matrices with prescribed row and column sums