Topics in Structural Graph Theory (Encyclopedia of Mathematics and its Applications, Series Number 147)

Main subject categories: • Graph theory • Structural graph theory • Graph theory ‒ Data processingThe 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. Calculus Deconstructed is a thorough and mathematically rigorous exposition of single-variable calculus for readers with some previous exposure to calculus techniques but not to methods of proof. This book is appropriate for a beginning Honors Calculus course assuming high school calculus or a'bridge course'using basic analysis to motivate and illustrate mathematical rigor. It can serve as a combination textbook and reference book for individual self-study. Standard topics and techniques in single-variable calculus are presented in context of a coherent logical structure, building on familiar properties of real numbers and teaching methods of proof by example along the way. Numerous examples reinforce both practical and theoretical understanding, and extensive historical notes explore the arguments of the originators of the subject. No previous experience with mathematical proof is assumed: rhetorical strategies and techniques of proof (reductio ad absurdum, induction, contrapositives, etc.) are introduced by example along the way. Between the text and exercises, proofs are available for all the basic results of calculus for functions of one real variable. "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"-- Provided by publisher Calculus Deconstructed is a thorough and mathematically rigorous exposition of single-variable calculus for readers with some previous exposure to calculus techniques but not to methods of proof. This book is appropriate for a beginning Honors Calculus course assuming high school calculus or a "bridge course" using basica analysis to motivate and illustrate mathematical rigor. It can serve as a combination textbook and reference book for individual self-study. Standard topics and techniques in single-variable calculus are presented in context of a coherent logical structure, building on familiar properties of real numbers and teaching methods of proof by example along the way. Numerous examples reinforce both practical and theoretical understanding, and extensive historical notes explore the arguments of the originators of the subject. No previous experience with mathematical proof is rhetorical strategies and techniques of proof (reductio ad absurdum, Machine 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á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. Precalculus -- Sequences And Their Limits -- Continuity -- Differentiation -- Integration -- Power Series -- The Rhetoric Of Mathematics (methods Of Proof). Zbigniew H. Nitecki. Includes Bibliographical References (pages 477-480) And Index. Mode Of Access: World Wide Web.