Posted by: atri | September 24, 2012

## Lect 11: Graph Basics

In today’s lecture, we looked at some basic graph definitions. The material was from Section 3.1 in the textbook. Next lecture (which is on Friday), we will prove that a tree on $n$ vertices has exactly $n-1$ edges. Then we will look at algorithms to check whether a given graph is connected or not. These will be from Sections 3.1 and 3.2 in the textbook.

The slides and notes for the lecture have been uploaded.