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.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s


%d bloggers like this: