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:
3.14159265359
Step-by-step explanation:
Answer:
y=4x
Step-by-step explanation:
it's enough to use first column (x=6, y=24). Inserting this data into equation y=kx, we can calculate k.
24=k*6
6k = 24
k = 24/6
k = 4
The answer and equation is 17 - 19 = -2
Answer: 172
Step-by-step explanation:
If what I did is right, the answer is 172.2 since 41/5 is 8.2 and I multiply 8.2 times 21, I get 172.2, which rounds to 172.
