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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
 Sell Back Your Copy for $20.25
Whether you buy it used on Amazon for $99.90 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $20.25.
Used Price$99.90
Trade-in Price$20.25
Price after
Trade-in$79.65 |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
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
"...a major addition to the literature of combinatorics." W. T. Tutte, Bulletin of the American Mathematical Society
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
6 of 7 people found the following review helpful:
4.0 out of 5 stars
An excellent treatise on applied combinatorics.,
By Michael R. Bastian (bastian257@netscape.net) (Salt Lake City, Utah) - See all my reviews
This review is from: Combinatorial Matrix Theory (Encyclopedia of Mathematics and its Applications) (Hardcover)
This book is an excellent resource for mathematicians, computer scientists, and engineers. The book shows how to use zero-one matrices and stochastic matrices in your work. The text pretty shows a lot of interesting properties different matrices have and how to compute various values associated with graphs from them. The book would be very useful for people interested in Neural Networks, Speech Recognition, Artificial Intelligence. It is mathematics, though and it describes the properties of the matrices and contains many proofs about these properties. Make sure that you have mastered linear algebra and combinatorics before reading this text.
2 of 5 people found the following review helpful:
1.0 out of 5 stars
dense monograph,
By
This review is from: Combinatorial Matrix Theory (Encyclopedia of Mathematics and its Applications) (Hardcover)
Sadly the authors have opted for a level
of abstraction that obscures many of the beautiful details. Particularly disappointing is the last chapter on matrix theory which veers off into an odd mixture of marginalia which have almost no applications.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Let A = [a,j], (i = 1,2,...,m;j = 1,2,...,n) be a matrix of m rows and n columns. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
subpermutation matrices, mutually orthogonal idempotent latin squares, oriented incidence matrix, generalized matrix function, nonnegative integral matrices, strong digraph, partial latin square, indecomposable relations, permute the lines, decomposable matrices, nonnegative integral vectors, exceptional matrices, spanning subdigraph, weak transversal, unimodular matroids, full indecomposability, general digraph, row sum vector, closed directed walk, partial transversal, indecomposable matrix, orthogonal latin squares, line permutations, column sum vector, tournament matrices Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Discrete Math, Academic Press, Cambridge University Press, Linear Alg, London Math, Let Abe, Linear Multilin, Cambridge Tracts, Prove Theorem, Linear Aig, Ars Combinatoria, Combinatorial Matrix Classes, Continuation of Exercise, Lecture Notes, Princeton University Press, Congressus Numerantium, Elsevier Science Publishers, Graph Let, Mathematisch Centrum, Recent Results, Search Comp, Selected Topics, The Hadamard, Theory of Graph Spectra New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Let A = [a,j], (i = 1,2,...,m;j = 1,2,...,n) be a matrix of m rows and n columns. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
subpermutation matrices, mutually orthogonal idempotent latin squares, oriented incidence matrix, generalized matrix function, nonnegative integral matrices, strong digraph, partial latin square, indecomposable relations, permute the lines, decomposable matrices, nonnegative integral vectors, exceptional matrices, spanning subdigraph, weak transversal, unimodular matroids, full indecomposability, general digraph, row sum vector, closed directed walk, partial transversal, indecomposable matrix, orthogonal latin squares, line permutations, column sum vector, tournament matrices Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Discrete Math, Academic Press, Cambridge University Press, Linear Alg, London Math, Let Abe, Linear Multilin, Cambridge Tracts, Prove Theorem, Linear Aig, Ars Combinatoria, Combinatorial Matrix Classes, Continuation of Exercise, Lecture Notes, Princeton University Press, Congressus Numerantium, Elsevier Science Publishers, Graph Let, Mathematisch Centrum, Recent Results, Search Comp, Selected Topics, The Hadamard, Theory of Graph Spectra New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 68
books:
See all 68 books this book cites
44
books
cite this book:
See all 44 books citing this book
- Graph Theory (Cambridge Mathematical Library) by W. T. Tutte on 11 pages
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel on 9 pages
- Combinatorial Mathematics (Carus Mathematical Monographs No. 14) by Herbert Ryser on 7 pages
- Algebraic Graph Theory (Cambridge Mathematical Library) by Norman Biggs on 7 pages
- Selected Topics in Graph Theory by Lowell W. Beineke on 5 pages
See all 68 books this book cites
- Matrices of Sign-Solvable Linear Systems (Cambridge Tracts in Mathematics) by Richard A. Brualdi on 7 pages
- Combinatorial Matrix Classes (Encyclopedia of Mathematics and its Applications) by Richard A. Brualdi on 7 pages
- Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) by Bolian Liu in Front Matter (1), and Front Matter (2)
- Matrices and Matroids for Systems Analysis (Algorithms and Combinatorics) by Kazuo Murota in Front Matter, and Back Matter
- Navier-Stokes Equations and Turbulence (Encyclopedia of Mathematics and its Applications) by C. Foias in Front Matter
See all 44 books citing this book
Books on Related Topics
(learn more)
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
