Answer:
a) The degree of vertex P is 2.
b) The degree of vertex O is 0.
c) The graph has 2 components.
Step-by-step explanation:
a) The edges that have P as a vertice are {M,P} and {P,R}.
b) There is no edge with extreme point O.
c) One of the components is the one with the only vertex as O and has no edges. The other component is the one with the rest of the vertices and all the edges described.
The file has a realization of the graph.
Answer:
Step-by-step explanation:
6 symbols and 4-symbol code so number of combinations wich doesn't contain the same symbol twice would be:
6•5•4•3 = 360
If code starts with a star followed by triangle that means only one posibility for first two symbols and code doesn't containing the same symbol twice means that left 4 symbols for next two.
So number of combinations of code starting with a star followed by triangle and doesn't containing the same symbol twice will be:
1•1•4•3 = 12
The probability that a randomly chosen code starts with a star followed by triangle and doesn't contain the same symbol twice: