Tata Institute of Fundamental Research
Counting the Number of Spanning Trees in a Graph
Student Seminar
Speaker:
Rakesh Venkat
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
Date:
Friday, 13 Nov 2009 (all day)
Venue:
A-212 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
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.
| Speaker: | Rakesh Venkat School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road |
| Date: | Friday, 13 Nov 2009 (all day) |
| Venue: | A-212 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
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.