1 / 15

CSE 321 Discrete Structures

CSE 321 Discrete Structures. Winter 2008 Lecture 26 Graph Theory. Announcements. Readings This week Graph Theory, 9.1 – 9.4 Schedule Quiz Section, Thursday No class Friday. Review Session, Sunday, 2pm Final Exam, Monday, March 17. Highlights from Lecture 25. Graph Theory

chretien
Download Presentation

CSE 321 Discrete Structures

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 321 Discrete Structures Winter 2008 Lecture 26 Graph Theory

  2. Announcements • Readings • This week • Graph Theory, 9.1 – 9.4 • Schedule • Quiz Section, Thursday • No class Friday. • Review Session, Sunday, 2pm • Final Exam, Monday, March 17

  3. Highlights from Lecture 25 • Graph Theory • Graph Applications • Facebook Graph • Web Graph • Communication Graphs a b a b V = {a, b, c} E = {{a,b}, {b,c}} V = {a, b, c} E = {<a,b>, <c,b>} c c

  4. Handshake Theorems

  5. Special Graphs • Complete Graphs Kn • Cycle Cn • Hypercube Qn • Mesh Mn,m

  6. Bipartite Graphs

  7. 2-coloring • A graph is two colorable iff all cycles have even length

  8. Graph Representations • Adjacency Lists • Adjacency Matrices • Incidence Matrices

  9. Graph Connectivity

  10. Strong connectivity vs. Weak Connectivity

  11. Strongly Connected Components

  12. Counting Paths Let A be the Adjacency Matrix. What is A2? b a c d e

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

  14. Graph Isomorphism II Are these graphs the same?

  15. Graph Isomorphism III Are these graphs the same?

More Related