This textbook covers a diversity of topics in graph and network theory, both from a theoretical standpoint, and from an applied modelling point of view. Mathematica® is used to demonstrate much of the modelling aspects. Graph theory and model building tools are developed in tandem with effective techniques for solving practical problems via computer implementation. The book is designed with three primary readerships in mind. Individual syllabi or suggested sequences for study are provided for each of three student audiences: mathematics, applied mathematics/operations research, and computer science. In addition to the visual appeal of each page, the text contains an abundance of gems. Most chapters open with real-life problem descriptions which serve as motivation for the theoretical development of the subject matter. Each chapter concludes with three different sets of exercises. The first set of exercises are standard and geared toward the more mathematically inclined reader.Many of these are routine exercises, designed to test understanding of the material in the text, but some are more challenging. The second set of exercises is earmarked for the computer technologically savvy reader and offer computer exercises using Mathematica. The final set consists of larger projects aimed at equipping those readers with backgrounds in the applied sciences to apply the necessary skills learned in the chapter in the context of real-world problem solving. Additionally, each chapter offers biographical notes as well as pictures of graph theorists and mathematicians who have contributed significantly to the development of the results documented in the chapter. These notes are meant to bring the topics covered to life, allowing the reader to associate faces with some of the important discoveries and results presented. In total, approximately 100 biographical notes are presented throughout the book.

The material in this book has been organizedinto three distinct parts, each with a different focus. The first part is devoted to topics in network optimization, with a focus on basic notions in algorithmic complexity and the computation of optimal paths, shortest spanning trees, maximum flows and minimum-cost flows in networks, as well as the solution of network location problems. The second part is devoted to a variety of classical problems in graph theory, including problems related to matchings, edge and vertex traversal, connectivity, planarity, edge and vertex coloring, and orientations of graphs. Finally, the focus in the third part is on modern areas of study in graph theory, covering graph domination, Ramsey theory, extremal graph theory, graph enumeration, and application of the probabilistic method.

Offers a rich collection of exercises as direct applications of theory Visually appealing with more than 100 biographical and historical notes enhancing understanding and concepts Integrates theoretical and applied aspects of the material covered, some with real-life problems

Autorentext

Michael A. Henning is a research professor at the Department of Mathematics and Applied Mathematics, University of Johannesburg. Professor Henning's research interests are in graph theory and hypergraph theory. His favourite research topics are in domination theory in graphs and transversals in hypergraphs. Additionally, Michael Henning has coauthored Total Domination in Graphs (SMM), Tranversals in Linear Uniform Hypergraphs (DEVM 63), From Domination to Coloring (SBM), and has coedited several volumes published with Springer. Jan H. van Vuuren is a professor of operations research at the Department of Industrial Engineering, Stellenbosch University. His research interests include combinatorial optimization over graphs, graph Ramsey theory, graph colouring problems, graph routing problems, and graph domination theory.

Inhalt
Preface.- List of Algorithms.- List of Bibliographical Notes.- Part 1. Topics in network optimisation.- 1. An introduction to graphs.- 2. Graph connectedness.- 3. Algorithmic complexity.- 4. Optimal paths.- 5. Trees.- 6. Location problems.- 7. Maximum flow networks.- 8. Minimum-cost network flows.- Part 2. Topics in classical graph theory.- 9. Matchings.- 10. Eulerian graphs.- 11. Hamiltonian graphs.- 12. Graph connectivity.- 13. Planarity.- 14. Graph colouring.- 15. Oriented graphs. Part 3. Topics in modern graph theory.- 16. Domination in graphs.- 17. Ramsey Theory.- 18. Extremal graph theory.- 19. Graph enumeration.- 20. The probabilistic method.- Index.