Topics in Structural Graph Theory

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Reference & Language, Reference
Cover of the book Topics in Structural Graph Theory by Ortrud R. Oellermann, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Ortrud R. Oellermann ISBN: 9781107240933
Publisher: Cambridge University Press Publication: November 8, 2012
Imprint: Cambridge University Press Language: English
Author: Ortrud R. Oellermann
ISBN: 9781107240933
Publisher: Cambridge University Press
Publication: November 8, 2012
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book Party Autonomy in Private International Law by Ortrud R. Oellermann
Cover of the book Latin American Development Priorities by Ortrud R. Oellermann
Cover of the book Ecological Governance by Ortrud R. Oellermann
Cover of the book The Construction Zone by Ortrud R. Oellermann
Cover of the book International Commercial Contracts by Ortrud R. Oellermann
Cover of the book Language and Linguistics by Ortrud R. Oellermann
Cover of the book Kant and the Faculty of Feeling by Ortrud R. Oellermann
Cover of the book Transformations of Ovid in Late Antiquity by Ortrud R. Oellermann
Cover of the book The ASEAN Economic Community by Ortrud R. Oellermann
Cover of the book Bad Company Level 2 Elementary/Lower-intermediate by Ortrud R. Oellermann
Cover of the book Computational Photonics by Ortrud R. Oellermann
Cover of the book Fourier Integrals in Classical Analysis by Ortrud R. Oellermann
Cover of the book Modification by Ortrud R. Oellermann
Cover of the book The Cambridge Companion to E. M. Forster by Ortrud R. Oellermann
Cover of the book Theory of Financial Risk and Derivative Pricing by Ortrud R. Oellermann
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy