Counting the Number of Spanning Trees in a Graph

by Mr Rakesh Venkat (STCS)

Friday 13 Nov 2009, 16:00 → 17:00 Asia/Kolkata

A-212 (Colaba Campus)

A classic counting algorithm, Kirchhoff's theorem gives a formula for finding the number of spanning trees in a simple, connected, undirected graph. I will discuss a simple proof of this theorem, based on elementary linear algebra.