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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
"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
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 11,44 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 6,80 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. N° de réf. du vendeur GRP102643957
Quantité disponible : 1 disponible(s)
Vendeur : Fireside Bookshop, Stroud, GLOS, Royaume-Uni
Cloth. Etat : Very Good. Etat de la jaquette : 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). N° de réf. du vendeur 300564
Quantité disponible : 1 disponible(s)
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Etat : 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. N° de réf. du vendeur Z1-A-003-03099
Quantité disponible : 1 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780521322652
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780521322652_new
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : 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. N° de réf. du vendeur 446932058
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 377 pages. 9.50x6.25x1.00 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521322650
Quantité disponible : 1 disponible(s)
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Hardcover. Etat : 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. N° de réf. du vendeur 9780521322652
Quantité disponible : 1 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : 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. N° de réf. du vendeur 9780521322652
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580249745
Quantité disponible : Plus de 20 disponibles