ONE 6th FORM Understanding Graphs and Their Types

What is a simple graph in graph theory?

• A graph with multiple edges between the same pair of vertices

• A graph with no loops and no multiple edges between the same pair of vertices

• A graph with loops but no multiple edges

• A graph with directed edges

Which of the following is a characteristic of a directed graph?

• Edges have no direction

• Edges have a specific direction from one vertex to another

• All vertices are connected to each other

• The graph contains no cycles

What is the main difference between a directed and an undirected graph?

• Directed graphs have weighted edges, undirected graphs do not

• Directed graphs have edges with a direction, undirected graphs have edges without a direction

• Directed graphs have cycles, undirected graphs do not

• Directed graphs are always connected, undirected graphs are not

Which of the following is a common graph traversal technique?

• Depth-First Search (DFS)

• Binary Search

• Quick Sort

• Linear Regression

In graph theory, what is a path?

• A sequence of vertices where each adjacent pair is connected by an edge

• A set of vertices with no edges

• A graph with no vertices

• A graph with only one vertex

What is a complete graph?

• A graph where each vertex is connected to every other vertex

• A graph with no edges

• A graph with a single cycle

• A graph with multiple disconnected components

Which of the following is true for a tree in graph theory?

• It contains at least one cycle

• It is a connected graph with no cycles

• It is a disconnected graph with cycles

• It is a graph with multiple loops

What is the degree of a vertex in an undirected graph?

• The number of edges connected to the vertex

• The number of vertices in the graph

• The number of cycles in the graph

• The number of paths through the vertex

Which graph traversal technique uses a queue data structure?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra's Algorithm

• Prim's Algorithm

What is a cycle in a graph?

• A graph with multiple disconnected components

• A path that visits every vertex exactly once

• A path that starts and ends at the same vertex

• A graph with no edges