Answer:
It isn't possible.
Step-by-step explanation:
Let G be a graph with n vertices. There are n possible degrees: 0,1,...,n-1.
Observe that a graph can not contain a vertice with degree n-1 and a vertice with degree 0 because if one of the vertices has degree n-1 means that this vertice is adjacent to all others vertices, then the other vertices has at least degree 1.
Then there are n vertices and n-1 possible degrees. By the pigeon principle there are two vertices that have the same degree.
Answer:
x ≤ 10
Step-by-step explanation:
Answer:
90 cubic inches
Step-by-step explanation:
Answer:
x - 3
Step-by-step explanation:
Answer:
the number 1 is going to be B and number 2 is going to be C
Step-by-step explanation:
hope this helps
