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

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.

in the math equation 8 x 7 = 56, the 8 and the 7 are both factors of 56, since in this lesson we will use square tiles to figure out the factors of a whole find as many different arrays as you can, but follow one important rule: all the rows must have the i can make two rows of nine, so 2 and 9 are both factors of 18.

step-by-step explanation: