FOR 1-3: Consider the following graphs: 1. Which of the graph/s above contains an Euler Trail? A. A and D B. B and C C. A, B, and C D. B, C, and D 2. Which of the graph/s above is/are Eulerian? A. None of the graphs B. Only B C. Only C D. B and C 3. Which of the graph/s above is/are Hamiltonian? A. A and B B. A and C C. A, B, and D D. A, C, and D FOR: 4-8: Consider the following graph: 4. What is the minimum distance between points C and F? A. 9 B. 10 C. 11 D. 12 5. Which of the following is a Hamiltonian Circuit for the given graph? A. AIBGCDEFHA B. DICBAIHGFED C. FIBAHGCDEF D. GFEIDCBAHG 6. What is the length of the Hamiltonian Circuit described in number 46? A. 35 B. 37 C. 39 D. 41 7. Which vertex in the given graph has the highest degree? A. Vertex C B. Vertex F C. Vertex H D. Vertex I 8. Which is referred to as an edge connecting the same vertex? A. Circuit B. Loop C. Path D. Repeated Edge
FOR 1-3: Consider the following graphs:
1. Which of the graph/s above contains an Euler Trail?
A. A and D B.
B and C
C. A, B, and C
D. B, C, and D
2. Which of the graph/s above is/are Eulerian?
A. None of the graphs
B. Only B
C. Only C
D. B and C
3. Which of the graph/s above is/are Hamiltonian?
A. A and B
B. A and C
C. A, B, and D
D. A, C, and D
FOR: 4-8: Consider the following graph:
4. What is the minimum distance between points C and F?
A. 9
B. 10
C. 11
D. 12
5. Which of the following is a Hamiltonian Circuit for the given graph?
A. AIBGCDEFHA
B. DICBAIHGFED
C. FIBAHGCDEF
D. GFEIDCBAHG
6. What is the length of the Hamiltonian Circuit described in number 46?
A. 35
B. 37
C. 39
D. 41
7. Which vertex in the given graph has the highest degree?
A. Vertex C
B. Vertex F
C. Vertex H
D. Vertex I
8. Which is referred to as an edge connecting the same vertex?
A. Circuit
B. Loop
C. Path
D. Repeated Edge
9. Which of the following statements is/are true?
i. The vertices of K4 all have degrees equal to 3.
ii. K4 is eulerian.
iii. K4 is Hamiltonian.
A. I and II
B. II and III
C. I and III
D. I, II, and III
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
