Probability on Trees and Networks
by Russell Lyons, Yuval Peres
Publisher: Cambridge University Press 2016
Number of pages: 716
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.
Home page url
Download or read it online for free here:
by Jorgen Bang-Jensen, Gregory Gutin - Springer
Digraphs presents a comprehensive survey of the study of directed graphs. It covers theoretical aspects with detailed proofs, and some algorithms and applications. The essential textbook and reference for graduate students and researchers.
by Roberto Tamassia (ed.) - CRC Press
The Handbook provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, science, and engineering.
by David Joyner, Minh Van Nguyen, Nathann Cohen - Google Code
An introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source software. The text covers graph algorithms, trees and forests, distance and connectivity, optimal graph traversals, planar graphs, etc.
by Keijo Ruohonen - Tampere University of Technology
These lecture notes form the base text for a Graph Theory course. The text contains an introduction to basic concepts and results in graph theory, with a special emphasis put on the network-theoretic circuit-cut dualism.