MIT6_042JS10_lec17_prob - H 3 that do not share some edge(b...

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

View Full Document Right Arrow Icon
Massachusetts Institute of Technology 6.042J/18.062J, Spring ’10 : Mathematics for Computer Science March 12 Prof. Albert R. Meyer revised March 13, 2010, 1029 minutes In-Class Problems Week 6, Fri. Problem 1. Prove that a graph is a tree iff it has a unique simple path between any two vertices. Problem 2. The n -dimensional hypercube, H n , is a graph whose vertices are the binary strings of length n . Two vertices are adjacent if and only if they differ in exactly 1 bit. For example, in H 3 , vertices 111 and 011 are adjacent because they differ only in the first bit, while vertices 101 and 011 are not adjacent because they differ at both the first and second bits. (a) Prove that it is impossible to find two spanning trees of
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: H 3 that do not share some edge. (b) Verify that for any two vertices x = y of H 3 , there are 3 paths from x to y in H 3 , such that, besides x and y , no two of those paths have a vertex in common. (c) Conclude that the connectivity of H 3 is 3. (d) Try extending your reasoning to H 4 . (In fact, the connectivity of H n is n for all n ≥ 1 . A proof appears in the problem solution.) Creative Commons 2010, Prof. Albert R. Meyer . MIT OpenCourseWare 6.042J / 18.062J Mathematics for Computer Science Spring 2010 For information about citing these materials or our Terms of Use, visit: ....
View Full Document

This note was uploaded on 05/27/2011 for the course CS 6.042J taught by Professor Prof.albertr.meyer during the Spring '11 term at MIT.

Page1 / 2

MIT6_042JS10_lec17_prob - H 3 that do not share some edge(b...

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