Bipartite Graphs and their Applications
Seiten
2008
Cambridge University Press (Verlag)
978-0-521-06512-2 (ISBN)
Cambridge University Press (Verlag)
978-0-521-06512-2 (ISBN)
This book treats the fundamental mathematical properties that hold for a family of Gaussian random variables.
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.
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.
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.
| Erscheint lt. Verlag | 12.6.2008 |
|---|---|
| Reihe/Serie | Cambridge Tracts in Mathematics |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 150 x 229 mm |
| Gewicht | 402 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-521-06512-7 / 0521065127 |
| ISBN-13 | 978-0-521-06512-2 / 9780521065122 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
