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.
The answer:
8 times
Explanation:
If you divide 168 by 20, you get 8.4, and the whole number is 8 so that’s the answer.
Step-by-step explanation:
hi im not sure it's right it was kinda confusing
A. Area = ½b × h
= ½ × 16 × 9
= 72
B. Area = b × h
= 26 × 18
= 468
C. Area = a²
= 11²
= 121
D. Area = ½(a+b) × h
= ½(6+21) × 8
= 108
Hope this helps :)
Please consider marking my answer the brainliest!
