Skip to content
Register Sign in Wishlist

Combinatorial Matrix Theory

$66.99 (C)

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: January 2014
  • availability: Available
  • format: Paperback
  • isbn: 9781107662605
Average user rating
(1 review)

$ 66.99 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    Reviews & endorsements

    "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

    See more reviews

    Customer reviews

    07th Oct 2013 by Ranju

    It is a very good book to getting knowledge about the combinatorial matrix theory. I like the most about its representation. thanks!

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 2014
    • format: Paperback
    • isbn: 9781107662605
    • length: 378 pages
    • dimensions: 229 x 152 x 20 mm
    • weight: 0.51kg
    • availability: Available
  • Table of Contents

    1. Incidence matrices
    2. Matrices and graphs
    3. Matrices and digraphs
    4. Matrices and bigraphs
    5. Combinatorial matrix algebra
    6. Existence theorems for combinatorially constrained matrices
    7. Some special graphs
    8. The permanent
    9. Latin squares.

  • Authors

    Richard A. Brualdi, University of Wisconsin, Madison

    Herbert J. Ryser, California Institute of Technology

Related Books

also by this author

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×