1

Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called

Correct Answer: tree

Make the most of this question

This page focuses on one Discrete Mathematics question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Discrete Mathematics MCQ: Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called | Extra Education