This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1. Is this a directed graph? 2. Is this graph connected? 3. Is this graph complete? 4. In this graph simple? 5. For a given webpage p, what does the outdegree of p represent? 6. For a given webpage p, what does the indegree of p represent? Problem 5 (6 points) [Problem 2.1(13) from the textbook] Using as few groups as possible, put the words “ﬁsh”, “sit”, “stay”, “play”, “diet”, “tree”, “duck”, “dog”, and “hen” into groups such that none of the words in a group have any letters in common. Use a graph model and graph coloring. Justify your answer: explain why your grouping uses the fewest groups as possible....
View
Full Document
 Fall '10
 CS
 Set Theory

Click to edit the document details