The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? 1. 7, 6, 5, 4, 4, 3, 2, 1 11. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8,7,7,6, 4, 2, 1,1 О 1 and 2 3 and 4 O 4 only 2 and 4 Submit answer ype here to search O is
Answers
Answered by
0
Answer:
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? 1. 7, 6, 5, 4, 4, 3, 2, 1 11. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8,7,7,6, 4, 2, 1,1 О 1 and 2 3 and 4 O 4 only 2 and 4 Submit answer ype here to search O is
Similar questions
English,
3 hours ago
English,
3 hours ago
English,
8 months ago
Computer Science,
8 months ago
English,
8 months ago