# Discrete Mathematics | Types of Graphs MCQs

Discrete Mathematics | Types of Graphs MCQs: This section contains multiple-choice questions and answers on Types of Graphs in Discrete Mathematics.
Submitted by Anushree Goswami, on July 27, 2022

1. Graphs with _____ vertices are called null graphs?

1. Odd
2. Even
3. Pendant
4. Isolated

Explanation:

Graphs with isolated vertices are called null graphs.

2. ____ graphs contain unordered pairs of vertices in the edge set?

1. Directed
2. Undirected
3. Multi
4. Null

Explanation:

Undirected graphs contain unordered pairs of vertices in the edge set.

3. In a graph, ____ refers to edges that can connect the same vertices over more than one edge?

1. Multigraph
2. Directed graph
3. Connected Graph
4. Disconnected Graph

Explanation:

In a graph, multigraph refers to edges that can connect the same vertices over more than one edge.

4. Graphs with multiple _____ are called multigraphs?

1. Edges
2. Loops
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

Graphs with multiple edges or loops are called multigraphs.

5. Directed graph is also known as -?

1. Connected graph
2. Digraph
3. Disconnected graph
4. Monograph

Explanation:

Directed graph is also known as digraph.

6. An edge in the _____ graph G has a direction and is identified by an ordered pair of vertex values (u, v), where u is the first vertex and v is the last vertex?

1. Connected
2. Directed
3. Undirected
4. Disconnected

Explanation:

An edge in the directed graph G has a direction and is identified by an ordered pair of vertex values (u, v), where u is the first vertex and v is the last vertex.

7. G=(V,E) is an _____ graph with n vertices where every vertex is connected to every other vertex?

1. Undirected Complete
2. Directed Complete
3. Undirected Incomplete
4. Directed Incomplete

Explanation:

Explanation: G=(V,E) is an undirected complete graph with n vertices where every vertex is connected to every other vertex.

8. How many edges are there in a complete graph with n vertices?

1. n (n - 1) / 2
2. n / 2
3. n (n + 1) / 2
4. n (n - 1)

Answer: A) n (n - 1) / 2

Explanation:

There are n (n - 1) / 2 edges in a complete graph with n vertices.

9. ____ graphs contain a path between any vertex u and vertex v?

1. Disconnected
2. Connected
3. Incomplete
4. Complete

Explanation:

Connected graphs contain a path between any vertex u and vertex v.

10. When there is __ path between two vertices in a graph, it is called disconnected?

1. No
2. One
3. Two
4. Multiple

Explanation:

When there is no path between two vertices in a graph, it is called disconnected.

11. If a subgraph of graph G is not contained in a bigger connected subgraph of G, then it is called the _____ of G?

1. Connected component
2. Disconnected component
3. Complete component
4. Incomplete component

Explanation:

If a subgraph of graph G is not contained in a bigger connected subgraph of G, then it is called the connected component of G.

12. ____graphs G = (V, E) have n vertices and are connected by arrows between their vertices?

1. Undirected complete
2. Directed complete
3. Undirected connected
4. Directed connected

Explanation:

Directed complete graphs G = (V, E) have n vertices and are connected by arrows between their vertices.

13. In a graph G, the ____ is a graph that has the same number of vertices as G, but only connects two vertices that are not related to one another?

1. Supplement
2. Complement
3. Alternate
4. None of the above

Explanation:

In a graph G, the complement is a graph that has the same number of vertices as G, but only connects two vertices that are not related to one another.

14. If the edges of a graph G=(V, E) are labeled with some ____, it is called a labeled graph?

1. Name
2. Data
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

If the edges of a graph G=(V, E) are labeled with some names or data, it is called a labeled graph.

15. When each edge of graph G=(V, E) contains a positive number w, it is called a ____ graph?

1. Directed
2. Complementary
3. Labeled
4. Weighted

Explanation:

When each edge of graph G=(V, E) contains a positive number w, it is called a weighted graph.