Euler's Theorem tells us:
a. how to count the number of odd vertices in a graph
b. about circuits that transverse each edge exactly once
c. how many loops there are in a graph
d. that every graph has an even number of odd vertices
Return to Homepage
|
Question #3