Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Exercise Set 14.3: 50

Answer

A complete graph is a graph with an edge connecting every pair of vertices in the graph.

Work Step by Step

A complete graph is a graph with an edge connecting every pair of vertices in the graph. Every vertex in the graph is connected by an edge to every other vertex in the graph.
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.