emelyrodas39
contestada

Which of the following BEST describes a TREE?

a) A complete graph, with exactly 4 vertices.

b) A connected graph, each vertex has a degree of 2 or greater.

c) A connected graph with at least 3 cycles.

d) A connected graph with no cycles.

Which of the following BEST describes a TREE a A complete graph with exactly 4 vertices b A connected graph each vertex has a degree of 2 or greater c A connect class=

Respuesta :

I think the answer c
wilmaralzate

Answer:

Step-by-step explanation:

We first start understanding what is a tree:

A tree can be understood as a graph such that two nodes ( or   vertices )  are connected by at most one path.

So the best definition that fit the above one is d. Note that

In a complete graph we have multiple paths to connected two nodes.  So that a is false. Similarly, b is false. If we have cycles in a graph, that implies more than two paths to connected two nodes. So c is false.