Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.4 Trees - Exercise Set 14.4: 47

Answer

A spanning tree of a graph is a subgraph which contains all of the original vertices, is connected, and does not contain any circuits.

Work Step by Step

A graph has vertices and edges. A subgraph is a graph with vertices and edges which are chosen from the set of vertices and edges in the original graph. A spanning tree of a graph is a subgraph which contains all of the original vertices, is connected, and does not contain any circuits.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.