Combinatorial Matrix Classes by Brualdi Richard (20 results)

Condition: New. SUPER FAST SHIPPING.

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Condition: New.

Condition: New.

Condition: New. In.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Like New. Like New. book.

Hardcover. Condition: new. Hardcover. A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date. Steven Finch provides 136 essays, each devoted to a mathematical constant or a class of constants, from the well known to the highly exotic. This book is helpful both to readers seeking information about a specific constant, and to readers who desire a panoramic view of all constants coming from a particular field, for example, combinatorial enumeration or geometric optimization. Unsolved problems appear virtually everywhere as well. This work represents an outstanding scholarly attempt to bring together all significant mathematical constants in one place. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: new. Hardcover. A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date. Steven Finch provides 136 essays, each devoted to a mathematical constant or a class of constants, from the well known to the highly exotic. This book is helpful both to readers seeking information about a specific constant, and to readers who desire a panoramic view of all constants coming from a particular field, for example, combinatorial enumeration or geometric optimization. Unsolved problems appear virtually everywhere as well. This work represents an outstanding scholarly attempt to bring together all significant mathematical constants in one place. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condition: New. pp. x + 544 1st Edition.

Hardcover. Condition: new. Hardcover. A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date. Steven Finch provides 136 essays, each devoted to a mathematical constant or a class of constants, from the well known to the highly exotic. This book is helpful both to readers seeking information about a specific constant, and to readers who desire a panoramic view of all constants coming from a particular field, for example, combinatorial enumeration or geometric optimization. Unsolved problems appear virtually everywhere as well. This work represents an outstanding scholarly attempt to bring together all significant mathematical constants in one place. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Condition: Brand New. 1st edition. 544 pages. 9.50x6.50x1.25 inches. In Stock.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date.

Hardcover. Condition: Brand New. 1st edition. 544 pages. 9.50x6.50x1.25 inches. In Stock. This item is printed on demand.

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Combinatorial Matrix Classes is a natural sequel to the author s pr.

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 966.

Condition: New. Print on Demand pp. x + 544 Illus.

Condition: New. PRINT ON DEMAND pp. x + 544.