Cargando…
Topics in structural graph theory /
"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 algorit...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York :
Cambridge University Press,
©2013.
|
| Colección: | Encyclopedia of mathematics and its applications ;
v. 147. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn855022869 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130805s2013 nyua ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d IDEBK |d CDX |d UMI |d COO |d E7B |d OCLCO |d EBLCP |d OCLCA |d DEBSZ |d OCLCQ |d OCLCF |d OCLCQ |d OTZ |d OCLCQ |d CEF |d OCLCQ |d INT |d OCLCQ |d WYU |d OCLCQ |d UKAHL |d OCLCQ |d OCLCO |d OCLCQ | ||
| 019 | |a 857059438 |a 857364905 |a 857720562 |a 1128256034 | ||
| 020 | |a 9781107249813 |q (electronic bk.) | ||
| 020 | |a 1107249813 |q (electronic bk.) | ||
| 020 | |a 9781107240933 | ||
| 020 | |a 110724093X | ||
| 020 | |a 9781107247321 | ||
| 020 | |a 1107247322 | ||
| 020 | |a 9781107248151 |q (e-book) | ||
| 020 | |a 1107248159 |q (e-book) | ||
| 020 | |z 9780521802314 | ||
| 020 | |z 0521802318 | ||
| 029 | 1 | |a AU@ |b 000052007944 | |
| 029 | 1 | |a DEBBG |b BV041432209 | |
| 029 | 1 | |a DEBSZ |b 392869969 | |
| 029 | 1 | |a DEBSZ |b 398281076 | |
| 029 | 1 | |a DEBSZ |b 445578939 | |
| 035 | |a (OCoLC)855022869 |z (OCoLC)857059438 |z (OCoLC)857364905 |z (OCoLC)857720562 |z (OCoLC)1128256034 | ||
| 037 | |a CL0500000283 |b Safari Books Online | ||
| 050 | 4 | |a QA166 |b .T645 2013eb | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511/.5 |2 23 |
| 084 | |a MAT008000 |2 bisacsh | ||
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Topics in structural graph theory / |c edited by Lowell W. Beineke, Robin J. Wilson. |
| 260 | |a New York : |b Cambridge University Press, |c ©2013. | ||
| 300 | |a 1 online resource (xiv, 327 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications ; |v 147 | |
| 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"-- |c Provided by publisher | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Preliminaries / Lowell W. Beineke and Robin J. Wilson -- Menger's theorem / Ortrud O. Oellermann -- Maximally connected graphs / Dirk Meierling and Lutz Volkmann -- Minimal connectivity / Matthias Kriesell -- Contractions of k-connected graphs / Kiyoshi Ando -- Connectivity and cycles / R.J. Faudree -- H-linked graphs / Michael Ferrara and Ronald J. Gould -- Tree-width and graph minors / Dieter Rautenbach and Bruce Reed -- Toughness and binding numbers / Ian Anderson -- Graph fragmentability / Keith Edwards and Graham Farr -- The phase transition in random graphs / Béla Bollobás and Oliver Riordan -- Network reliability and synthesis / F.T. Boesch, A. Satyanarayana and C.L. Suffel -- Connectivity algorithms / Abdol-Hossein Esfahanian -- Using graphs to find the best block designs / R.A. Bailey and Peter J. Cameron. | |
| 588 | 0 | |a Print version record. | |
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Graph theory |x Data processing. | |
| 650 | 7 | |a MATHEMATICS |x Discrete Mathematics. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a Graph theory |x Data processing. |2 fast |0 (OCoLC)fst00946587 | |
| 700 | 1 | |a Beineke, Lowell W. | |
| 700 | 1 | |a Wilson, Robin J. | |
| 776 | 0 | 8 | |i Print version: |t Topics in structural graph theory. |d New York : Cambridge University Press, ©2013 |z 9780521802314 |w (DLC) 2012022109 |w (OCoLC)795763408 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications ; |v v. 147. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=574827 |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH34848894 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH34668496 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH26478843 | ||
| 938 | |a Coutts Information Services |b COUT |n 26003301 | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1357324 | ||
| 938 | |a ebrary |b EBRY |n ebr10740543 | ||
| 938 | |a EBSCOhost |b EBSC |n 574827 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis26003301 | ||
| 938 | |a YBP Library Services |b YANK |n 11086974 | ||
| 938 | |a YBP Library Services |b YANK |n 10903366 | ||
| 938 | |a YBP Library Services |b YANK |n 11057356 | ||
| 994 | |a 92 |b IZTAP | ||