# Assn7 - List all cycles. What is the longest path this...

This preview shows page 1. Sign up to view the full content.

1. Consider the following graph: e g i f h b d a c How many vertices does it have? How many edges does it have? How many vertices of degree three does it have? List the neighbors of the vertex i . Give an example of a walk from the vertex a to b that is not a trail. Give an example of a trail from a to b that is not a path. Give an example of a path from a to b .
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: List all cycles. What is the longest path this graph has as a subgraph? What is the longest path this graph has as an induced subgraph? 2. Prove that any graph with n vertices and e edges has a vertex of degree at most 2 e n . 3. Chapter 11.1, exercises 5, 6, 7. 4. Chapter 11.2, exercises 6, 9, 11, 14....
View Full Document

## This note was uploaded on 07/15/2010 for the course MACM 201 taught by Professor Marnimishna during the Spring '09 term at Simon Fraser.

Ask a homework question - tutors are online