Let a graph have vertices {l, m, n, o, p, q, r, s} and edge set {{l, r}, {m, p}, {m, q}, {n, q}, {p, r}, {q, s}, {r, s}} .
a. what is the degree of vertex p?
b. what is the degree of vertex o?
c. how many components does the graph have?

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.

the circle one

50

step-by-step explanation: