| 000 | 02863nam a22002657a 4500 | ||
|---|---|---|---|
| 001 | sulbI001902 | ||
| 003 | BD-SySUS | ||
| 005 | 20160629132024.0 | ||
| 008 | 160629s2013 nyua 000 0 eng d | ||
| 020 | _a9780521802314 (hardback) | ||
| 040 |
_aDLC _cDLC _dDLC _dBD-SySUS |
||
| 082 | 0 | 0 |
_a511.5 _223 _bTOP |
| 245 | 0 | 0 |
_aTopics in structural graph theory / _cedited by Lowell W. Beineke, Robin J. Wilson. |
| 260 |
_aNew York : _bCambridge University Press, _cc2013. |
||
| 300 |
_axiv, 327p. : _bill. ; _c24 cm. |
||
| 490 | 0 |
_aEncyclopedia of mathematics and its applications ; _v147 |
|
| 505 | 8 | _aMachine generated contents note: Foreword Ortrud R. Oellermann; Preliminaries Lowell W. Beineke and Robin J. Wilson; 1. Menger's theorem Ortrud O. Oellermann; 2. Maximal connectivity 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 number Ian Anderson; 9. Graph fragmentability Keith Edwards and Graham Farr; 10. The phase transition in random graphs Bela Bollob�as 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. | |
| 520 | _a"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"-- | ||
| 650 | 0 |
_aGraph theory _xData processing. _928343 |
|
| 650 | 7 |
_aMATHEMATICS / Discrete Mathematics. _2bisacsh _928344 |
|
| 700 | 1 |
_aBeineke, Lowell W. _928345 |
|
| 700 | 1 |
_aWilson, Robin J. _916945 |
|
| 856 | 4 | 2 |
_3Cover image _uhttp://assets.cambridge.org/97805218/02314/cover/9780521802314.jpg |
| 942 |
_2ddc _cBK |
||
| 999 |
_c62207 _d62207 |
||