This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full 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 http://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Spring 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms ....
View Full
Document
 Spring '11
 Prof.AlbertR.Meyer
 Computer Science

Click to edit the document details