Topics in structural graph theory

著者

• Beineke, Lowell W.
• Wilson, Robin J.
• Oellermann, Ortrud R.

書誌事項

Topics in structural graph theory

edited by Lowell W. Beineke, Robin J. Wilson ; academic consultant, Ortrud R. Oellermann

（Encyclopedia of mathematics and its applications / edited by G.-C. Rota, 147）

Cambridge University Press, 2013

• : hardback

注記

Includes bibliographical references and index

内容説明・目次

内容説明

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.

目次

• 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 Bela Bollobas 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.

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BB10754519
• ISBN:
  • 9780521802314
• LCCN: 2012022109
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: New York
• ページ数/冊数: xiv, 327 p.
• 大きさ: 24 cm
• 分類:
  • LCC : QA166
  • DC23 : 511/.5
• 件名:
  • LCSH : Graph theory -- Data processing
  • FREE : MATHEMATICS / Discrete Mathematics. bisacsh
• 親書誌ID:
  • BA00064663