hw11 - COT 3100: Applications of Discrete Structures April...

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

View Full Document Right Arrow Icon
COT 3100: Applications of Discrete Structures April 21, 2010 Solution to Homework 8 Lecturer: Prof. My T. Thai TA: Thang N. Dinh 1 Section 9.1 Problem 10 Solution: The graph in Exercise 3 is simple. The multigraph in Exercise 4 can be made simple by removing one of the edges between a and b , and two of the edges between b and d . The pseudograph in Exercise 5 can be made simple by removing the three loops and one edge in each of the three pairs of parallel edges. The multigraph in Exercise 6 can be made simple by removing one of the edges between a and c , and one of the edges between b and d . The other three are not undirected graphs. (Of course removing any superset of the answers given here are equally valid answers; in particular, we could remove all the edges in each case.) Problem 16 Solution: Each person is represented by a vertex, with an edge between two vertices if and only if the people are acquainted. 2
Background image of page 1

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

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

This note was uploaded on 01/22/2012 for the course COT 3100 taught by Professor Staff during the Spring '08 term at University of Florida.

Page1 / 3

hw11 - COT 3100: Applications of Discrete Structures April...

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