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 Daniel Ullman, Edward Scheinerman - Wiley
In this book the authors explore generalizations of core graph theory notions by allowing real values to substitute where normally only integers would be permitted. The aim is to prove fractional analogues of the theorems of traditional graph theory.
by Reinhard Diestel - Springer
Textbook on graph theory that covers the basics, matching, connectivity, planar graphs, colouring, flows, substructures in sparse graphs, Ramsey theory for graphs, hamiltonian cycles, random graphs, minors, trees, and WQO.
by Alexander Schrijver
From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.
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.