Announcements Readings This week CSE 321 Discrete Structures - PDF document

Announcements • Readings – This week CSE 321 Discrete Structures • Graph Theory, 9.1 – 9.4 • Schedule – Quiz Section, Thursday Winter 2008 – No class Friday. Lecture 26 – Review Session, Sunday, 2pm Graph Theory – Final Exam, Monday, March 17 Highlights from Lecture 25 Handshake Theorems • Graph Theory a b a b V = {a, b, c} V = {a, b, c} E = {{a,b}, {b,c}} E = {<a,b>, <c,b>} c c • Graph Applications – Facebook Graph – Web Graph – Communication Graphs Special Graphs Bipartite Graphs • Complete Graphs K n • Cycle C n • Hypercube Q n • Mesh M n,m

2-coloring Graph Representations • A graph is two colorable iff all cycles have • Adjacency Lists even length • Adjacency Matrices • Incidence Matrices Strong connectivity vs. Weak Graph Connectivity Connectivity Strongly Connected Counting Paths Components Let A be the Adjacency Matrix. What is A 2 ? b a c d e

Graph Isomorphism I Graph Isomorphism II Are these graphs the same? Are these two graphs the same? y a d x w b c z Graph Isomorphism III Are these graphs the same?