Combinatorial Matrix Theory

Klappentext The book deals with the many connections between matrices! graphs! diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix and Latin squares. The book ends by considering algebraic characterizations of combinatorical properties and the use of combinatorial arguments in proving classical algebraic theorems! including the Cayley-Hamilton Theorem and the Jorda Canonical Form. Inhaltsverzeichnis 1. Incidence matrices; 2. Matrices and graphs; 3. Matrices and digraphs; 4. Matrices and bigraphs; 5. Combinatorial matrix algebra; 6. Existence theorems for combinatorially constrained matrices; 7. Some special graphs; 8. The permanent; 9. Latin squares.

Product details

• Authors: Richard A. Brualdi, Richard A. (University of Wisconsin Brualdi, Richard A. Ryser Brualdi, Brualdi Richard a., Herbert J. Ryser
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 26.07.1991
• EAN: 9780521322652
• ISBN: 978-0-521-32265-2
• No. of pages: 380
• Series: New Studies in Archaeology
• Subject: Natural sciences, medicine, IT, technology > Mathematics > Basic principles