Please select all the situations below that are POSSIBLE and do not mark those t

Question

Please select all the situations below that are POSSIBLE and do not mark those that are IMPOSSIBLE. Each list of numbers is a degree list (list of the degrees of all the vertices) of a graph. If there are extra restrictions - the graph is simple, or a tree, etc - it will be noted in the question. Question 2 options: Simple graph, degrees: 3, 2, 1 Graph, degrees: 1, 2, 3 Tree, degrees: 1, 1, 1, 1, 1, 2, 5 Tree, degrees: 0, 0, 1, 1, 2, 3, 3. Simple graph, degrees: 0, 0, 0, 2. Please select all the situations below that are POSSIBLE and do not mark those that are IMPOSSIBLE. Each list of numbers is a degree list (list of the degrees of all the vertices) of a graph. If there are extra restrictions - the graph is simple, or a tree, etc - it will be noted in the question. Please select all the situations below that are POSSIBLE and do not mark those that are IMPOSSIBLE. Each list of numbers is a degree list (list of the degrees of all the vertices) of a graph. If there are extra restrictions - the graph is simple, or a tree, etc - it will be noted in the question. Simple graph, degrees: 3, 2, 1 Graph, degrees: 1, 2, 3 Tree, degrees: 1, 1, 1, 1, 1, 2, 5 Tree, degrees: 0, 0, 1, 1, 2, 3, 3. Simple graph, degrees: 0, 0, 0, 2. Simple graph, degrees: 3, 2, 1 Graph, degrees: 1, 2, 3 Tree, degrees: 1, 1, 1, 1, 1, 2, 5 Tree, degrees: 0, 0, 1, 1, 2, 3, 3. Simple graph, degrees: 0, 0, 0, 2. Simple graph, degrees: 3, 2, 1 Graph, degrees: 1, 2, 3 Tree, degrees: 1, 1, 1, 1, 1, 2, 5 Tree, degrees: 0, 0, 1, 1, 2, 3, 3. Simple graph, degrees: 0, 0, 0, 2.

Explanation / Answer

a) Possible

b)possible

c) impossible

d)possible

e)impossible

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.