MTH 231 Lecture 26: Lesson 10.6
12 Jun 2018
School
Department
Course
Professor
et cya
as
Acycle Cn nz3consists of nverticles VVz Un
and edges VVz VzUs VnlVin and VnV
cana
lllllll
ex wheels
we obtain aWh lWh when we add an
additional vertex to acyelle On for n23
and connect this new vertex to each of the
nreutices in Ch by new edges The wheels
Wz Wy Wsand Wu
in
AIN
definition
simple graph Gis called bipartite if its
vertex set Vcan be partitioned into two
disjoint sets Vand Vz Men that every edge
in the graph that connects avertex in va
vertex in Vz
Document Summary
A cycle cn n z 3 consists of n verticles v vz and edges v vz. Vn v c ana l l l l l l l ex wheels we obtain a wh additional and n reutices. Wz wy w s l wh when we add vertex to a cyelle on n 2 3 new vertex in ch by new edges the wheels an for to each of the and wu connect this in. Mt the graph g q b a c. 9 to b is a subgraph of rs so. If we add the edge connecting c and w to g we obtain the subgraph induced by w a b e c v e and an edge e e e. Given a graph g we can produce a subgraph of g by removing the edge e the resulting subgraph denoted by g e has the set v as g.
