Cantitate/Preț
Produs

Bipartite Graphs and their Applications: Cambridge Tracts in Mathematics, cartea 131

Autor Armen S. Asratian, Tristan M. J. Denley, Roland Häggkvist
en Limba Engleză Paperback – 11 iun 2008
Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. However, sometimes they have been considered only as a special class in some wider context. This book deals solely with bipartite graphs. Together with traditional material, the reader will also find many unusual results. Essentially all proofs are given in full; many of these have been streamlined specifically for this text. Numerous exercises of all standards have also been included. The theory is illustrated with many applications especially to problems in timetabling, chemistry, communication networks and computer science. For the most part the material is accessible to any reader with a graduate understanding of mathematics. However, the book contains advanced sections requiring much more specialized knowledge, which will be of interest to specialists in combinatorics and graph theory.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 42897 lei  6-8 săpt.
  Cambridge University Press – 11 iun 2008 42897 lei  6-8 săpt.
Hardback (1) 77716 lei  6-8 săpt.
  Cambridge University Press – 12 iul 1998 77716 lei  6-8 săpt.

Din seria Cambridge Tracts in Mathematics

Preț: 42897 lei

Nou

Puncte Express: 643

Preț estimativ în valută:
8213 8553$ 6815£

Carte tipărită la comandă

Livrare economică 14-28 februarie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521065122
ISBN-10: 0521065127
Pagini: 272
Dimensiuni: 150 x 229 x 15 mm
Greutate: 0.4 kg
Ediția:1
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Mathematics

Locul publicării:Cambridge, United Kingdom

Cuprins

1. Basic concepts; 2. Biparticity; 3. Metric properties; 4. Connectivity; 5. Maximum matchings; 6. Expanding properties; 7. Subgraphs with restricted degrees; 8. Edge colourings; 9. Doubly stochastic matrices and bipartite graphs; 10. Coverings; 11. Some combinatorial applications; 12. Bipartite subgraphs of arbitrary graphs.

Recenzii

"...excellent monograph...This is an invaluable book and an indispensable resource for any serious student of graph theory." Mathematics of Computing
"...the treatment of topics is clear and self-contained and shows considerable design, work, and thought...as a volume in the series Cambridge Tracts in Mathematics, this book has the mandate to 'take up a single thread in a wide subject and follow its ramifications, thus throwing light on its various aspects.' This book does that, beautifully." Siam Review

Descriere

This book treats the fundamental mathematical properties that hold for a family of Gaussian random variables.