All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $9.86Trending at AU $16.86
- AU $11.51Trending at AU $18.84
- AU $24.98Trending at AU $25.26
- AU $64.07Trending at AU $75.02
- AU $28.70Trending at AU $37.03
- AU $44.96Trending at AU $47.20
- AU $24.92Trending at AU $28.26
About this product
- DescriptionThis book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. This subject concerns itself with the use of matrix theory and linear algebra in proving results in combinatorics (and vice versa), and with the intrinsic properties of matrices viewed as arrays of numbers rather than algebraic objects in themselves. There are chapters dealing with the many connections between matrices, graphs, digraphs 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 cover the permanent of a matrix, and Latin squares. The final chapter deals with algebraic characterizations of combinatorial properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jordan Canical Form. The book is sufficiently self-contained for use as a graduate course text, but complete eugh for a standard reference work on the basic theory. Thus it will be an essential purchase for combinatorialists, matrix theorists, and those numerical analysts working in numerical linear algebra.
- Author(s)Herbert J. Ryser,Richard A. Brualdi
- PublisherCambridge University Press
- Date of Publication23/01/2014
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note10 b/w illus.
- Weight510 g
- Width152 mm
- Height229 mm
- Spine20 mm
- Format DetailsTrade paperback (US)
This item doesn't belong on this page.
Thanks, we'll look into this.