Cantitate/Preț
Produs

Topics in Structural Graph Theory

Editat de Lowell W. Beineke, Robin J. Wilson, Ortrud R. Oellermann
en Limba Engleză Hardback – 2 iul 2014
The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references.
Citește tot Restrânge

Preț: 83132 lei

Preț vechi: 107964 lei
-23% Nou

Puncte Express: 1247

Preț estimativ în valută:
14711 17250$ 12919£

Carte tipărită la comandă

Livrare economică 02-16 februarie 26
Livrare express 26 decembrie 25 - 01 ianuarie 26 pentru 7917 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521802314
ISBN-10: 0521802318
Pagini: 342
Ilustrații: 60 b/w illus.
Dimensiuni: 161 x 240 x 25 mm
Greutate: 0.74 kg
Ediția:New.
Editura: Cambridge University Press
Locul publicării:Cambridge, United Kingdom

Cuprins

Foreword Ortrud R. Oellermann; Preface Lowell W. Beineke and Robin J. Wilson; Preliminaries Lowell W. Beineke and Robin J. Wilson; 1. Menger's theorem Ortrud R. Oellermann; 2. Maximally connected graphs Dirk Meierling and Lutz Volkmann; 3. Minimal connectivity Matthias Kriesell; 4. Contractions of k-connected graphs Kiyoshi Ando; 5. Connectivity and cycles R. J. Faudree; 6. H-linked graphs Michael Ferrara and Ronald J. Gould; 7. Tree-width and graph minors Dieter Rautenbach and Bruce Reed; 8. Toughness and binding numbers Ian Anderson; 9. Graph fragmentability Keith Edwards and Graham Farr; 10. The phase transition in random graphs Béla Bollobás and Oliver Riordan; 11. Network reliability and synthesis F. T. Boesch, A. Satyanarayana and C. L. Suffel; 12. Connectivity algorithms Abdol-Hossein Esfahanian; 13. Using graphs to find the best block designs R. A. Bailey and Peter J. Cameron; Notes on contributors; Index.

Descriere

No other book covers such a wide scope of this aspect of graph theory.