MCQ Subject: Graph Theory

A graph with ‘n’ vertices, where each vertex is connected to every other vertex, has how many edges?

What is the maximum number of edges in a simple directed graph with 5 vertices?

In a tree with n nodes, what is the minimum number of edges required to ensure the graph remains connected and acyclic?

In a graph, which of the following best describes a Hamiltonian path?

Which graph is known for having the property that every pair of vertices has exactly one common neighbor?

Which algorithm is specifically designed to find all Strongly Connected Components (SCCs) in a directed graph efficiently?

In the graph with vertices A, B, C, D and edges AB, BC, CD, DA, and AC, which path is a Hamiltonian path?

Which of the following graphs is guaranteed to have a Hamiltonian cycle?

In graph theory, which type of path visits each vertex of a graph exactly once?

In graph theory, which of the following best describes an Euler Circuit?