Fr 0568 # 28
Posted: Sat Mar 27, 2010 9:14 am
Damn this paper! Can t even half way through.
Anyways here s another one which i have a problem with.
(figure)
The figure above shows an undirectede graph with six vertices. Enuff edges are to be deleted from the graph in order to leave a spnning tree, which is a connected sibgraph having the same six vertices and no cycles. How many edgges are to deleted/
1,2,3,4, or 5?
Anyways here s another one which i have a problem with.
(figure)
The figure above shows an undirectede graph with six vertices. Enuff edges are to be deleted from the graph in order to leave a spnning tree, which is a connected sibgraph having the same six vertices and no cycles. How many edgges are to deleted/
1,2,3,4, or 5?