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}} .
1 answer:
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.
You might be interested in
Answer:
The distance is:
d = 10.0 units (Rounded to the nearest the Tenths Place)
Step-by-step explanation:
Given the points
- (3,4)
- (4,-6)
The distance 'd' between (3,4) and (4,-6)
substituting the points values
units (Rounded to the nearest the Tenths Place)
Thus, the distance is:
d = 10.0 units (Rounded to the nearest the Tenths Place)
Using the geometric mean concept, it is found that the value of a is 18.
----------------------
The geometric mean, of a data-set of n elements, , is given by:
That is, the nth root of the multiplication of all elements.
----------------------
In this question:
- Two elements(n = 2), a and 34.
Thus:
We find the square of each side, so:
Simplifying both sides by 17:
The value of a is 18.
A similar example is given at brainly.com/question/15010240