Graph and Network Theory

An Applied Approach using Mathematica®

Häftad, Engelska, 2023

Av Michael A. Henning, Jan H. van Vuuren, Jan H. Van Vuuren, Jan H. van Vuuren

1 119 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Inbunden

1 539 kr

Skickas inom 10-15 vardagar

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.

Produktinformation

Utgivningsdatum2023-06-05
Mått178 x 254 x 46 mm
Vikt1 474 g
FormatHäftad
SpråkEngelska
SerieSpringer Optimization and Its Applications
Antal sidor766
FörlagSpringer International Publishing AG
ISBN9783031038594

Tillhör följande kategorier

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.

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.