CSC165H1 Lecture Notes - Lecture 18: Cul1
3
CSC165H1 Full Course Notes
Verified Note
3 documents
Document Summary
C u e t p vertices edges theorem. Keyidea anedgeis a set of 2 vertices i e asubsetof vofsize 2. So iei e ofsubsetsofsize 2 ofu z lui i z z cut. Wesay uandu are connected in g ifandonly if thereexists apathbtwthem u v. Wesay g itself is connected if andonly if all pairs of vertices are connected. G is connected v u v e v conncg u v. Interesting question given a graphg determinewhether it is connected develop an algorithm csc2631373 determine a conditionthatimpliesthat a graph is connected. E 3 vt t t l n e it f g v e ivi h a iel. Pt basecaselet n i t g lv e. Thisstatement is vacuosly true has at leastone edge an edgerequires two vertices. Inductions and we uprove p rtt klk i. Let g vse assumeivi httl and let 3 we willprove g is connected. To use i h firstneed to checkthat i e l 34 1.
