𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the precise number of (0,1)-matrices in (R,S)

✍ Scribed by Bo-Ying Wang; Fuzhen Zhang

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
259 KB
Volume
187
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

This paper gives a reduced formula for the precise number of matrices in 9.1(R, S), the class of matrices of zeros and ones with row and column sum vectors R and S, respectively. With the new formula, the computing time is greatly shortened.

πŸ“œ SIMILAR VOLUMES

On the number of different permanents of
On the number of different permanents of some sparse (0,1)-circulant matrices
✍ Giovanni Resta; Giovanni Sburlati πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 235 KB

Starting from known results about the number of possible values for the permanents of (0, 1)-circulant matrices with three nonzero entries per row, and whose dimension n is prime, we prove corresponding results for n power of a prime, n product of two distinct primes, and n = 2 β€’ 3 h . Supported by

On the energy of (0, 1)-matrices
On the energy of (0, 1)-matrices
✍ H. Kharaghani; B. Tayfeh-Rezaie πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 107 KB
The relationship between the class %plan
The relationship between the class %plane1D;518;2(R,S) of (0,1,2)-matrices and the collection of constellation matrices
✍ Su-Mei Hou πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 341 KB

Let ~I2(R, S) be the class of all (0, l, 2)-matrices with a prescribed row sum vector R and column sum vector S. A (0, 1,2)-matrix in N2(R,S) is defined to be parsimonious provided no (0, 1,2)-matrix with the same row and column sum vectors has fewer positive entries. In a parsimonious (0, 1,2)-matr

On the number of (r,r+1)- factors in an
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
✍ A. J. W. Hilton πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 113 KB πŸ‘ 1 views

## Abstract For integers __d__β‰₯0, __s__β‰₯0, a (__d, d__+__s__)‐__graph__ is a graph in which the degrees of all the vertices lie in the set {__d, d__+1, …, __d__+__s__}. For an integer __r__β‰₯0, an (__r, r__+1)‐__factor__ of a graph __G__ is a spanning (__r, r__+1)‐subgraph of __G__. An (__r, r__+1)‐