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 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.
by David Guichard - Whitman College
The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.
by Madhumangal Pal - arXiv
Intersection graphs are important in both theoretical as well as application point of view. Different type of intersection graphs are defined, among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important.
by Ton Kloks, Yue-Li Wang - viXra.org
This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs. For this last topic we found it necessary to include a chapter on graph classes.