Networks

How many vertices are there in the network?

• 4

• 5

• 6

• 7

What is the degree of vertex C?

• 1

• 2

• 3

• 4

Is vertex B an odd or even vertex?

• Odd Vertex

• Even Vertex

Which vertices have the highest degree?

• A and B

• A and C

• C and D

• D and E

How many edges are in the network?

• 5

• 6

• 7

• 8

What is the degree of vertex E?

• 2

• 3

• 4

• 5

How many odd vertices are in the network shown?

• 0

• 1

• 2

• 3

If the edges represented friendship, who has the MOST friends?

• Andrew

• Nikhil

• Patty

• Rochelle

What is a Eulerian Circuit?

• A path in a graph that visits every edge exactly once and returns to the start.

• A path in a graph that visits every vertex exactly once and returns to the start.

• A path beginning and ending at the same vertex.

How do you determine whether a graph has an Euler path?

• All vertices are even

• At most one odd vertex

• Two odd vertices

• At most three odd vertices