MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible value of n is ___________ |
| A. | 7 |
| B. | 43 |
| C. | 13 |
| D. | 10 |
| Answer» D. 10 | |
| 2. |
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8? |
| A. | 15 |
| B. | 8 |
| C. | 5 |
| D. | 23 |
| Answer» C. 5 | |
| 3. |
In a finite graph the number of vertices of odd degree is always ______ |
| A. | even |
| B. | odd |
| C. | even or odd |
| D. | infinite |
| Answer» B. odd | |
| 4. |
Degree of a graph with 12 vertices is _______ |
| A. | 25 |
| B. | 56 |
| C. | 24 |
| D. | 212 |
| Answer» D. 212 | |
| 5. |
A simple graph can have _______ |
| A. | multiple edges |
| B. | self loops |
| C. | parallel edges |
| D. | no multiple edges, self-loops and parallel edges |
| Answer» E. | |
| 6. |
Disconnected components can be created in case of ___________ |
| A. | undirected graphs |
| B. | partial subgraphs |
| C. | disconnected graphs |
| D. | complete graphs |
| Answer» D. complete graphs | |
| 7. |
What is a complete digraph? |
| A. | connection of nodes without containing any cycle |
| B. | connecting nodes to make at least three complete cycles |
| C. | start node and end node in a graph are same having a cycle |
| D. | connection of every node with every other node including itself in a digraph |
| Answer» E. | |
| 8. |
The graph representing universal relation is called _______ |
| A. | complete digraph |
| B. | partial digraph |
| C. | empty graph |
| D. | partial subgraph |
| Answer» B. partial digraph | |
| 9. |
Let, D = be a directed graph or digraph,then D’ = is a subgraph if ___________ |
| A. | A’ ⊂ A and R’ = R ∩ (A’ x A’) |
| B. | A’ ⊂ A and R ⊂ R’ ∩ (A’ x A’) |
| C. | R’ = R ∩ (A’ x A’) |
| D. | A’ ⊆ A and R ⊆ R’ ∩ (A’ x A’) |
| Answer» B. A’ ⊂ A and R ⊂ R’ ∩ (A’ x A’) | |
| 10. |
A directed graph or digraph can have directed cycle in which ______ |
| A. | starting node and ending node are different |
| B. | starting node and ending node are same |
| C. | minimum four vertices can be there |
| D. | ending node does not exist |
| Answer» C. minimum four vertices can be there | |