In computer science, Spanning tree refers to which of the following?
- A. A function that is both one-to-one and onto, pairing every element uniquely.
- B. A relation that is reflexive, symmetric, and transitive.
- C. A symbol or word, such as AND, OR, or NOT, used to combine or modify propositions in logic.
- D. A subgraph that includes all vertices of a graph connected with the minimum number of edges and no cycles. ✓
Correct answer
D. A subgraph that includes all vertices of a graph connected with the minimum number of edges and no cycles.
Explanation
Spanning tree refers to a subgraph that includes all vertices of a graph connected with the minimum number of edges and no cycles.