Announcements Readings This week CSE 321 Discrete Structures - - PDF document

announcements
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

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
  • Graph Applications

– Facebook Graph – Web Graph – Communication Graphs

a c b a c b V = {a, b, c} E = {{a,b}, {b,c}} V = {a, b, c} E = {<a,b>, <c,b>}

Handshake Theorems Special Graphs

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

Bipartite Graphs

slide-2
SLIDE 2

2-coloring

  • A graph is two colorable iff all cycles have

even length

Graph Representations

  • Adjacency Lists
  • Adjacency Matrices
  • Incidence Matrices

Graph Connectivity Strong connectivity vs. Weak Connectivity Strongly Connected Components Counting Paths

Let A be the Adjacency Matrix. What is A2?

d c b e a

slide-3
SLIDE 3

Graph Isomorphism I

Are these two graphs the same?

a d c b w x y z

Graph Isomorphism II

Are these graphs the same?

Graph Isomorphism III

Are these graphs the same?