The vertex and edge set of a graph is given below. draw a representation of the graph.

v = {f, g, h, i, j, k, l, m, n, o, p, q, r}

e = { {f, g}, {f, h}, {f, i}, {f, k}, {g, h}, {h, m}, {h, p}, {i, q}, {i, r}, {j, r}, {k, m}, {k, o}, {k, r}, {l, q}, {m, q} }

which vertex has the highest degree?

is this graph connected?

Three vertices have the highest degree: F, H and K.

The graph is not connected.

Step-by-step explanation:

The degree of a vertex is the number of edges incident on that vertex. In this graph, there are three vertices having the highest degree (4): F, H and K.

The graph is not connected as there aren't any paths joining vertex N with any of the other vertices.

the answer

b. they are parallel and will never intersect.

answer: no, but if it does it's a obvious pattern.

step-by-step explanation: