Combinatorial matrix classes
Author(s)
Bibliographic Information
Combinatorial matrix classes
（Encyclopedia of mathematics and its applications / edited by G.-C. Rota, v. 108）
Cambridge University Press, 2006
Available at 48 libraries
Note
Includes bibliographical references (p. 500-535) and index
Description and Table of Contents
Description
A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date.
Table of Contents
- 1. Introduction
- 2. Basic existence theorems for matrices with prescribed properties
- 3. The class A(R
- S) of (0,1)-matrices
- 4. More on the class A(R
- S) of (0,1)-matrices
- 5. The class T(R) of tournament matrices
- 6. Interchange graphs
- 7. Classes of symmetric integral matrices
- 8. Convex polytopes of matrices
- 9. Doubly stochastic matrices.
by "Nielsen BookData"