Question-45

Consider a graph G with 7 vertices, where there exists a path between every pair of vertices. Which of the following is a possible listing of the degrees of vertices in graph G?

• 2, 3, 4, 1, 6, 2, 3
• 4, 4, 4, 3, 4, 3, 3
• 1, 2, 1, 1, 1, 2, 1
• 1, 2, 2, 2, 2, 2, 1

Answer

• 2, 3, 4, 1, 6, 2, 3
• 4, 4, 4, 3, 4, 3, 3
• 1, 2, 1, 1, 1, 2, 1
• 1, 2, 2, 2, 2, 2, 1