This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: { e 1 , ··· , e m } . The incidence matrix of G is a n × m matrix M = [ m i,j ] 1 ≤ i ≤ n, 1 ≤ j ≤ m ] so that m ij = 1 ⇐⇒ edge e j is incident to vertex i. Examples. February 1 Graphs, continued, Page 4 9.4 Graph Isomorphism Two graphs G 1 = ( V 1 , E 1 ) and G 2 = ( V 2 , E 2 ) are isomorphic if there is a onetoone correspondence σ : V 1 → V 2 such that for any u, v ∈ V 1 , u 6 = v , { u, v } ∈ E 1 ⇐⇒ { σ ( u ) , σ ( v ) } ∈ E 2 . Examples. February 1 Graphs, continued, Page 5...
View
Full Document
 Winter '07
 YaoyunShi
 Graph Theory, V  vertices, Discrete Mathematics Lecture

Click to edit the document details