Combinatorial Matrix Theory (Encyclopedia of Mathematics and Its Applications, 39) - Softcover

Brualdi, Richard A.; Ryser, Herbert J.

Softcover

ISBN 10: 1107662605 ISBN 13: 9781107662605

Publisher: Cambridge University Press, 2014

Synopsis

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.

About this title

Book Description

This 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.

Review

"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

Edition details

• Publisher: Cambridge University Press
• Publication date: 2014
• Language: English
• ISBN 10: 1107662605
• ISBN 13: 9781107662605
• Binding: Paperback
• Number of pages: 378