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.
1. C
2.D
3.A
4.B
Hope this helps!
Answer:
vvvvvvvv
Step-by-step explanation:
A.36
B.5
C.1.70
D.7
E.3.80
F.100
G.14
H.0.64
I.1.02
J.9
Basically you dived the two numbers for your awnser
only the first statement is true - it is the experimental probability. the rest is incorrect: the ratio is not the number of trials; the theoretical probability should be 0.5 (for unbiased coins); ratio never represents a number of occurences.
hold on i will send in the comments i’m working on it rn
