2011-Homework_8

# 2011-Homework_8 - ITI 111 Homework 8 Dr Paul Kantor Graph Theory 1 A Eulerian Circuit is A A path that crosses a bridge twice once in each

This preview shows pages 1–3. Sign up to view the full content.

ITI 111 Homework 8 1 Dr. Paul Kantor Graph Theory 1. A Eulerian Circuit is: A. A path that crosses a bridge twice, once in each direction. B. A path that crosses all edges in a graph and returns to the original vertex where it started without going over the same edge twice. C. A path that crosses all edges in a graph and returns to the original vertex where it started without going over the same vertex twice. D. A path through a graph with even-degree nodes. E. None of the above. For the following problems, consider the following graph: 2. The degree of vertex A, d(A) = A. 1 B. 2 C. 3 D. 4 3. The degree of vertex B, d(B) = A. 3 B. 4 C. 5 D. 6 4. Does this graph have an Eulerian circuit? A. Yes B. No C. Can’t tell 5. A graph where one of the vertices has a degree of 16:

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

View Full Document
ITI 111 Homework 8 2 Dr. Paul Kantor A. Must have an Eulerian Circuit. B. Cannot have an Eulerian Circuit. C. Either has or does not have a Eulerian Circuit (can’t tell). D.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/20/2012 for the course 790 373 taught by Professor Boros during the Fall '09 term at Rutgers.

### Page1 / 3

2011-Homework_8 - ITI 111 Homework 8 Dr Paul Kantor Graph Theory 1 A Eulerian Circuit is A A path that crosses a bridge twice once in each

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online