CSE 2321 Lecture Notes - Lecture 30: Spanning Tree

6 views12 pages
Published on 30 Nov 2019
Course
Professor
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
Lecture 30
Tree connected undirected graph w
no cycles
Forest any undirected graph wout
cycles
0
000All trees are forests
Not all forests are
trees
tree forest
connected components of aforest
are trees
spanning Tree of aconnected graph
is aspawning subgraph that is
atree
ST is not unique unless the
graph is atree
application to design of
communication networks
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 12 pages and 3 million more documents.

Already have an account? Log in
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
O
EDF
Graph
0
a
Spanning
Thee
oto
oiowohhkh.de
two afatthensthemuatyfies
sayfisonoemosphic
can be relabeled to match
the vertices of the ones in a
way that preserves adjacency
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 12 pages and 3 million more documents.

Already have an account? Log in
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
40 40
These graphs are
isomorphic
4spanning forest of agraph
is aspanning subgraph
that is aforest
Uumonnected graph spanning
forest
Connected graph spanning
tree
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 12 pages and 3 million more documents.

Already have an account? Log in

Get OneClass Notes+

Unlimited access to class notes and textbook notes.

YearlyBest Value
75% OFF
$8 USD/m
Monthly
$30 USD/m
You will be charged $96 USD upfront and auto renewed at the end of each cycle. You may cancel anytime under Payment Settings. For more information, see our Terms and Privacy.
Payments are encrypted using 256-bit SSL. Powered by Stripe.