Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: -OnTimeBooks-, Phoenix, AZ, Estados Unidos de America
EUR 40,81
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 77,76
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 73,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Cambridge University Press 2014-01-23, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Chiron Media, Wallingford, Reino Unido
EUR 72,08
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 81,56
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. Num Pages: 378 pages, 10 b/w illus. BIC Classification: PBF; PBV. Category: (P) Professional & Vocational. Dimension: 229 x 152 x 20. Weight in Grams: 51. . 2014. Reprint. paperback. . . . .
Idioma: Inglés
Publicado por Cambridge University Press CUP, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 103,88
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 378.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 104,35
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. Num Pages: 378 pages, 10 b/w illus. BIC Classification: PBF; PBV. Category: (P) Professional & Vocational. Dimension: 229 x 152 x 20. Weight in Grams: 51. . 2014. Reprint. paperback. . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 101,17
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. 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.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Revaluation Books, Exeter, Reino Unido
EUR 75,16
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. reprint edition. 367 pages. 8.75x6.00x0.75 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 79,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Majestic Books, Hounslow, Reino Unido
EUR 106,10
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 378 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.
Idioma: Inglés
Publicado por Cambridge University Press, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 105,21
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 378.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2014
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: CitiRetail, Stevenage, Reino Unido
EUR 81,74
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. 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. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, 2013
ISBN 10: 1107662605 ISBN 13: 9781107662605
Librería: moluna, Greven, Alemania
EUR 78,72
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 prope.