Items related to Combinatorial Matrix Theory (Encyclopedia of Mathematics...

Combinatorial Matrix Theory (Encyclopedia of Mathematics and its Applications, Series Number 39) - Hardcover

  • 4.00 out of 5 stars
    6 ratings by Goodreads
 
9780521322652: Combinatorial Matrix Theory (Encyclopedia of Mathematics and its Applications, Series Number 39)

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.

"synopsis" may belong to another edition of 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

"About this title" may belong to another edition of this title.

Buy Used

Condition: Good
Former library book; may include...
View this item

FREE shipping within U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

9781107662605: Combinatorial Matrix Theory (Encyclopedia of Mathematics and Its Applications, 39)

Featured Edition

ISBN 10:  1107662605 ISBN 13:  9781107662605
Publisher: Cambridge University Press, 2014
Softcover

Search results for Combinatorial Matrix Theory (Encyclopedia of Mathematics...

Stock Image

Ryser, Herbert J., Brualdi, Richard A.
Published by Cambridge University Press, 1991
ISBN 10: 0521322650 ISBN 13: 9780521322652
Used Hardcover

Seller: Better World Books, Mishawaka, IN, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP102643957

Contact seller

Buy Used

US$ 99.99
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Richard A. Brualdi; Herbert J. Ryser
Published by Cambridge University Press, 1992
ISBN 10: 0521322650 ISBN 13: 9780521322652
Used Hardcover

Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Cloth. Condition: Very Good. Dust Jacket Condition: Very Good. Reprint. Type: Book N.B. Small plain label to front paste down. Letter J stamped on title page. Corners of boards a little bumped. (MATHEMATICS). Seller Inventory # 300564

Contact seller

Buy Used

US$ 111.94
Convert currency
Shipping: US$ 33.96
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Brualdi, Richard A.
Published by Cambridge University Press, 1991
ISBN 10: 0521322650 ISBN 13: 9780521322652
Used Hardcover

Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-A-003-03099

Contact seller

Buy Used

US$ 152.33
Convert currency
Shipping: US$ 14.45
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Brualdi, Richard A.; Ryser, Herbert J.
Published by Cambridge University Press, 1991
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Feb2215580249745

Contact seller

Buy New

US$ 169.21
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Brualdi, Richard A.; Ryser, Herbert J.
Published by Cambridge University Press, 1991
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover

Seller: California Books, Miami, FL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # I-9780521322652

Contact seller

Buy New

US$ 191.00
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Richard A. Brualdi
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover

Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. This is the first book 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 Canonical Form. The book is sufficiently self-contained for use as a graduate course text, but complete enough 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521322652

Contact seller

Buy New

US$ 202.32
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Brualdi, Richard A.; Ryser, Herbert J.
Published by Cambridge University Press, 1991
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9780521322652_new

Contact seller

Buy New

US$ 198.81
Convert currency
Shipping: US$ 16.27
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Brualdi, Richard A./ Ryser, Herbert J.
Published by Cambridge Univ Pr, 1991
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover
Print on Demand

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Brand New. 377 pages. 9.50x6.25x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __0521322650

Contact seller

Buy New

US$ 207.77
Convert currency
Shipping: US$ 13.58
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Richard A. Brualdi
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover

Seller: AussieBookSeller, Truganina, VIC, Australia

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. This is the first book 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 Canonical Form. The book is sufficiently self-contained for use as a graduate course text, but complete enough 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521322652

Contact seller

Buy New

US$ 197.57
Convert currency
Shipping: US$ 37.00
From Australia to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Richard A. Brualdi
ISBN 10: 0521322650 ISBN 13: 9780521322652
New Hardcover

Seller: CitiRetail, Stevenage, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. This is the first book 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 Canonical Form. The book is sufficiently self-contained for use as a graduate course text, but complete enough 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521322652

Contact seller

Buy New

US$ 211.27
Convert currency
Shipping: US$ 50.26
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

There are 4 more copies of this book

View all search results for this book