What is a complete graph?
a) A graph in which every pair of vertices is connected by an edge
b) A graph with no edges
c) A tree with all nodes filled
d) A graph with equal weights on all edges
Answer:
a) A graph in which every pair of vertices is connected by an edge
Explanation:
A complete graph is a graph in which every pair of distinct vertices is connected by a unique edge. If a complete graph has n vertices, it will have n(n-1)/2 edges.
In a complete graph, each vertex is adjacent to every other vertex, meaning that the graph is highly connected. Complete graphs are often used in network theory to represent fully connected systems.
A complete graph with n vertices is denoted by K_n, and it is an important concept in graph theory for studying various properties of connectivity and traversal.
Reference:
DSA (Data Structures and Algorithms) MCQ Questions and Answers