• Title Graph Theory, 5th Edition (Graduate Texts in Mathematics)
• Authors Reinhard Diestel
• Publisher: Springer; 5th ed. 2017 edition (July 21, 2017), 4th Edition. edition (October 31, 2010)
• Paperback: 428 pages
• eBook PDF
• Language: English
• ISBN-10: 3662536218
• ISBN-13: 978-3662536216
• Share This:  

Book Description

This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail.

More than two decades after the appearance of most of the classical texts on the subject, this fresh introduction to Graph Theory offers a reassessment of what are the theory's main fields, methods and results today.

Viewed as a branch of pure mathematics, the theory of finite graphs is developed as a coherent subject in its own right, with its own unifying questions and methods.

Graph Theory can be used at various different levels. It contains all the standard basic material to be taught in a first undergraduate course, complete with detailed proofs and numerous illustrations.

For a graduate course, the book offers proofs of several more advanced results, most of which thus appear in a book for the first time. These proofs are described with as much care and detail as their simpler counterparts.

To the professional mathematician, finally, the book affords an overview of graph theory as it stands today: with its typical questions and methods, its classic results, and some of those developments that have made this subject such an exciting area in recent years.

• Reinhard Diestel is Professor at the Department of Mathematics at the University of Hamburg.

• Amazon
• Amazon (2012 Edition)

• Graph Theory
• Combinatorics and Game Theory
• Discrete and Finite Mathematics
• Operations Research (OR), Linear Programming, Optimization, and Approximation

• Graph Theory, 5th Edition, by Reinhard Diestel (Graduate Texts in Mathematics)
• The Mirror Site (1) - PDF
• Mirror Site (2) - 2005 Edition - PDF (422 pages)

• Graph Theory Lessons (Christopher P. Mawata)

  This text covers the important elementary topics of graph theory and its apps. It utilizes a java software as an investigative tool which can draw, edit and manipulate simple graphs, examine properties of the graphs, and demonstrate them using animation.

• Graph Theory - Advanced Algorithms and Applications

  Not only will the methods and explanations help you to understand more about graph theory, but you will find it joyful to discover ways that you can apply graph theory in your applications or scientific research.

• Graph Theory and Complex Networks (Maarten van Steen)

  This book aims to explain the basics of graph theory that are needed at an introductory level for students in computer or information sciences. It also aims to provide an introduction to the modern field of network science.

• Network Science (Albert-László Barabási)

  Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of topics from physics to computer science, engineering, economics and the social sciences, introduces network science to an interdisciplinary audience.

• Probability on Trees and Networks (Russell Lyons, et al.)

  This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.

• Random Graphs and Complex Networks (Remco van der Hofstad)

  This rigorous introduction to network science presents Random Graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them.

• Graph Algorithms: Practical Examples in Apache Spark and Neo4j

  This book is a practical guide to getting started with graph algorithms for developers and data scientists who have experience using Apache Spark or Neo4j. You'll walk through hands-on examples that show you how to use graph algorithms in Apache Spark/Neo4j.

• A Survey of Statistical Network Models (Anna Goldenberg, et al.)

  This book aims to provide the reader with an entry point to the voluminous literature on statistical network modeling. It guides the reader through the development of key stochastic network models, touches upon a number of examples and commonalities.

• Lecture Notes on Graph Theory (Tero Harju)

  These are introductory lecture notes on graph theory. It offers undergraduates a remarkably student-friendly introduction to graph theory and takes an engaging approach that emphasizes graph theory's history.

• Algorithmic Graph Theory (David Joyner, et al)

  This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. It's especially suitable for computer scientists and mathematicians interested in computational complexity.

• Explorations in Algebraic Graph Theory (Chris Godsil, et al.)

  This book aims to express properties of graphs in algebraic terms, then to deduce theorems about them. It tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix, using the Sage.

• An Introduction to Combinatorics and Graph Theory

  This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques.

• Graph Databases: New Opportunities for Connected Data

  This book provides a practical foundation for those who want to apply Graph Database to real-world business solutions. You'll learn why graph database are useful, where they're applicable, and how to design and implement solutions that use them.