Matrices & Determinants, Computer Science & Combinatorics
Available on Bookshop
Write a review
Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Log in to track your reading progress.
Overview
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.Synopsis
This is the first book devoted to the exposition of combinatorial matrix theory. It can be used as a graduate course text, but is complete enough for a standard reference work on the basic theory.
Editorials
From the Publisher
"A reader who is familiar with basic results in matrix theory will surely be captivated by this concise self-contained introduction to graph theory and combinatorial ideas and reasoning." S. K. Tharthare, Mathematical Reviews"...a major addition to the literature of combinatorics." W. T. Tutte, Bulletin of the American Mathematical Society
Book Details
Published
July 1, 1991
Publisher
Cambridge University Press
Pages
380
Format
Hardcover
ISBN
9780521322652