School of Technology and Computer Science Seminars

Counting the Number of Spanning Trees in a Graph

by Mr. Rakesh Venkat (STCS)

Friday, November 13, 2009 from to (Asia/Kolkata)
at Colaba Campus ( A-212 )
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.
Organised by John Barretto