HW9 - minimum spanning tree. Give either a proof or a...

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

View Full Document Right Arrow Icon
CSE21 FA11 Homework #9 (11/22/11) 9.1 Does every connected graph has a spanning tree? Give either a proof or a counterexample. 9.2 (a) Select a spanning tree of minimum total weight from the following weighted graph. (b) Find all spanning trees (list their edges sets) of the following graph. 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
9.3 Is there a graph G satisfying the following three requirements? Give either a proof or a counterexample. 1. G has 10 vertices, and 2. G has 30 edges, and 3. G has 3 connected components. 9.4 If the edge weights of a graph are all different, then the graph has a unique
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: minimum spanning tree. Give either a proof or a counterexample. 9.5 Let us dene the height of a rooted tree to the length of the path from the root to the deepest node in the tree. A (rooted) tree with only one node (the root) has a height of zero. A balanced binary tree is commonly dened as a binary tree in which the height of the two subtrees of every node never dier by more than one. What is the maximum (and the minimum) number of nodes in a balanced binary tree of height h 0? 2...
View Full Document

This note was uploaded on 02/02/2012 for the course CSE 21 taught by Professor Graham during the Fall '07 term at UCSD.

Page1 / 2

HW9 - minimum spanning tree. Give either a proof or a...

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

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