lec08-graphs - EECS 203 Winter 2007 Discrete Mathematics...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
EECS 203, Winter 2007 Discrete Mathematics Lecture 8 Graphs January 30 Reading: Rosen [9.1-9.2] January 30 Graphs, Page 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8.1 Graphs Informally: a set of dots connected by lines. Examples of graphs Social graphs. Co-authorship graphs. A simple graph G = ( V, E ) consists of a finite set V of vertices , and a set of edges E ⊆ {{ u, v } : u, v V, u 6 = v } . If an edge e = { u, v } , u and v are called the endpoints of e , and e is said to be incident to u and v , and e connects u and v , and u and v are adjacent , and u is a neighbor of v . The degree of a vertex is the number of its neighbors. January 30 Graphs, Page 2
Background image of page 2
Special graphs Complete graphs Empty graphs Path, cycles Hypercube Peterson graph Johnson graph (Kneser graph) Bipartite graph: a simple graph G = ( V, E ) is bipartite if there is a partition of V into two disjoint sets V 1 and V 2 such that E ⊆ {{ u, v } : u V 1 , v V 2 } . Regular graph: a graph is
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/01/2008 for the course EECS 203 taught by Professor Yaoyunshi during the Winter '07 term at University of Michigan.

Page1 / 7

lec08-graphs - EECS 203 Winter 2007 Discrete Mathematics...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online