Ask Question

What does it mean to say that a graph is complete?

+3
Answers (1)
  1. Today, 20:17
    0
    The statement which says that a graph is complete means an undirected graph whose every pair of vertices is connected by an particular edge or unique edge.

    An undirected graph is a graph whose edges soea not contain any direction means to which vertex they are directed.

    A complete graph has an edge between every pair of vertices that exist in that graph.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “What does it mean to say that a graph is complete? ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers