QCM : Fundamentals of Graph Theory — 8 questions

Question 1

1. When was the fundamental concept of a graph, including its components like vertices and edges, first established in mathematical literature?

1736

1920s

1600s

1830s

Explication

Leonhard Euler first introduced the idea of a graph and its components in 1736 while solving the Seven Bridges of Königsberg problem. This marks the earliest formalization of graph components in mathematical literature, making 1736 the correct answer.

Answer

Leonhard Euler in 1736

Answer

Model systems where relationships are one-way or unidirectional

Answer

G is a graph where S is the set of vertices and A is the set of edges

Answer

A graph that contains no loops and no multiple edges

Answer

A graph where every pair of distinct vertices is connected by an edge

Answer

There exists a path between any two vertices

Question 2

2. Who is credited with first establishing the fundamental concepts of graph theory, including vertices and edges, and in which year?

Leonhard Euler in 1736

Isaac Newton in 1687

Carl Gauss in 1801

Bernhard Riemann in 1859

Explication

Leonhard Euler is credited with initiating the systematic study of graphs in 1736, specifically with his solution to the Seven Bridges of Königsberg problem. This marks the formal beginning of graph theory as a branch of mathematics.

Question 3

3. What is the primary role of directed graphs in modeling real-world systems?

Model systems where relationships are one-way or unidirectional

Illustrate complete mutual connections among all entities

Show systems that are fully reachable from any point to any other

Represent systems where entities interact bidirectionally with equal importance

Explication

Directed graphs are specifically used to model systems where relationships have a direction, such as traffic flow or data transmission, indicating the relationship goes from one entity to another but not necessarily vice versa.

Question 4

4. In graph terminology, what does the set denoted as G = (S, A) represent?

G is a graph where S is the set of edges and A is the set of vertices

G is a graph where S is the set of vertices and A is the set of edges

G is a set of graphs with S and A as components

G is a graph with vertices S and acts as the adjacency matrix A

Explication

In graph theory notation, G = (S, A) signifies a graph where S is the set of vertices (or points) and A is the set of edges (or segments). This fundamental structure defines a graph.

Question 5

5. Which of the following best describes a simple graph?

A graph with no vertices

A graph that contains no loops and no multiple edges

A graph that contains all possible edges between vertices

A graph with directed edges only

Explication

A simple graph is characterized by having no loops (edges connecting a vertex to itself) and no multiple edges between the same pair of vertices, making it 'simple' in structure.

Question 6

6. In the context of graph types, what defines a complete graph?

A graph where no vertices are connected

A graph where every pair of distinct vertices is connected by an edge

A graph with exactly one edge

A directed graph with all edges pointing in the same direction

Explication

A complete graph is one in which every pair of different vertices shares a direct connection, meaning it has the maximum number of edges for the number of vertices.

Question 7

7. What is the term for a sequence of edges in a graph where each edge shares a common vertex with the next, and the sequence begins and ends at the same vertex?

Path

Cycle

Chain

Loop

Explication

A cycle is a chain of edges passing through a sequence of vertices that begins and ends at the same vertex, forming a closed loop.

Question 8

8. Which property distinguishes a connected graph from other types in graph theory?

It contains no edges

There exists a path between any two vertices

It has only directed edges

All vertices have the same degree

Explication

A connected graph is defined by the property that there's at least one path connecting any pair of vertices, ensuring the graph is in one piece.

QCM : Fundamentals of Graph Theory — 8 questions

Questions et réponses du QCM

1. When was the fundamental concept of a graph, including its components like vertices and edges, first established in mathematical literature?

2. Who is credited with first establishing the fundamental concepts of graph theory, including vertices and edges, and in which year?

3. What is the primary role of directed graphs in modeling real-world systems?

4. In graph terminology, what does the set denoted as G = (S, A) represent?

5. Which of the following best describes a simple graph?

6. In the context of graph types, what defines a complete graph?

7. What is the term for a sequence of edges in a graph where each edge shares a common vertex with the next, and the sequence begins and ends at the same vertex?

8. Which property distinguishes a connected graph from other types in graph theory?

Révisez avec les flashcards

Approfondir avec la fiche

Cours similaires

Actions et mouvement

Gel pour les veines

Grandeurs composées et conversions

Réciproque de Pythagore

Réussir ses études efficacement

Les émotions humaines

Crée tes propres QCM