Cover of Applied Graph Theory: An Introduction With Graph Optimization And Algebraic Graph Theory by Griffin Christopher H, ISBN 9798886130980
Combinatorics

Applied Graph Theory: An Introduction With Graph Optimization And Algebraic Graph Theory

Contributor(s): Author Format: Paperback

Paperback ยท ISBN 9798886130980

โ‚น1,276 20%
โ‚น1,595

Inclusive of GST and other taxes

100% Quality Assurance
No Account Creation Required
Fast Delivery
Secured Transactions

Arriving at your doorstep in 2-3 days

Our logisitcs team will make sure everyitem is delivered safely

Key Specifications

ISBN 9798886130980
Publisher World Scientific
Language English
Page count 304

This book serves as an introduction to graph theory and its applications. It is intended for a senior undergraduate course in graph theory but is also appropriate for beginning graduate students in science or engineering. The book presents a rigorous (proof-based) introduction to graph theory while also discussing applications of the results for solving real-world problems of interest. The book is divided into four parts. Part 1 covers the combinatorial aspects of graph theory including a discussion of common vocabulary, a discussion of vertex and edge cuts, Eulerian tours, Hamiltonian paths and a characterization of trees. This leads to Part 2, which discusses common combinatorial optimization problems. Spanning trees, shortest path problems and matroids are all discussed, as are maximum flow problems. Part 2 ends with a discussion of graph coloring and a proof of the NP-completeness of the coloring problem. Part 3 introduces the reader to algebraic graph theory, and focuses on Markov chains, centrality computation (e.g., eigenvector centrality and page rank), as well as spectral graph clustering and the graph Laplacian. Part 4 contains additional material on linear programming, which is used to provide an alternative analysis of the maximum flow problem. Two appendices containing prerequisite material on linear algebra and probability theory are also provided.