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:
5%
Step-by-step explanation:
150/3000
0.05
5%
commission btw is
7.772 million people live in Cairo.
658,893 people live in Washington DC.
So it's false.
Hello there!
Your answer is 3 hours and 30 minutes.
I hope I have been of assistance!
~ Fire
