GOOD: This book is in excellent condition, but has a previous owner's name written on the front end page. There is no other writing on its pages. There is some foxing on the top page edge.
Product Details
From the dust jacket: "The early chapters deal with the many connections with matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorial properties and to obtain various matrix decomposition theorems. Other chapters treat the permanent of a matrix and latin squares. The final chapter deals with algebraic characterization of combinatorial properties and the use of combinatorial arguments in proving such classical theorems as the Cayley-Hamilton theorem and the Jordan canonical form.
"The book assumes that the reader is familiar with basic results of matrix theory but it is otherwise self-contained. It includes many exercises, making it suitable for use as a graduate text. It is also complete enough for a standard reference work in on the basic theory. It will be an essential tool for combinatorialists, matrix theorists and numerical linear algebraists who use combinatorial structure in the analysis of matrices."
