Question

How many vertices have an odd degree?

Question 1 options:


1


2


3


4
Question 2 (1 point)


If a graph has exactly 2 odd vertices, then
Question 2 options:


an Euler circuit exists


no circuit exists


at least one path exists


no path exists
Question 3 (1 point)


Which path shows trace-ability?
Question 3 options:


EA,AB,BC,CD,DE


EA,AB,BC,CD,DE,EC,CA


AC,CB,BA,AE,ED,DC


BC,CD,DE,EA,AB
Question 4 (1 point)

Saved

In order to trace this graph without lifting your pen or retracing an edge you COULD begin at vertex
Question 4 options:


A


B


C


D
Question 5 (1 point)

Saved

This graph has a/is


Question 5 options:


Euler Circuit


Euler Path


Not traceable


Euler Circuit and Euler Path

Answer 1

did you find the answers :( ??

Answer 2

Question 1:

How many vertices have an odd degree?

Question 1 ANSWER:

2

______

Question 2:

If a graph has exactly 2 odd vertices, then

Question 2 ANSWER:

at least one path exists

______

Question 3:

Which path shows trace-ability?

Question 3 ANSWER:

AC,CB,BA,AE,ED,DC

______

Question 4:

In order to trace this graph without lifting your pen or retracing an edge you COULD begin at vertex

Question 4 ANSWER:

B

______

Question 5:

This graph has a/is

Question 5 ANSWER:

Euler Path

______

Sources:

I got a 100% on the quiz, and I have taken AP statistics already before.