# Data Structure Questions and Answers-Multigraph and Hypergraph

DOWNLOAD FREE PDF <<CLICK HERE>>

## Data Structure Questions and Answers-Multigraph and Hypergraph

Congratulations - you have completed Data Structure Questions and Answers-Multigraph and Hypergraph.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.
 Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Given Adjacency matrices determine which of them are PseudoGraphs?

i) {{1, 0} {0, 1}}

ii) {{0, 1}{1, 0}}

iii) {{0, 0, 1}{0, 1, 0}{1, 0, 0}}

 A only i) B ii) and iii) C i) and iii) D i) ii) and iii)
Question 1 Explanation:
In i) self loops exist for both the vertices, in iii) self loop exists in the second vertex.

 Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
All undirected Multigraphs contain eulerian cycles.
 A True B False
Question 2 Explanation:
Only graphs with every vertex having even degree have eulerian circuits or cycles.

 Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Determine the number of vertices for the given Graph or Multigraph?

G is a 4-regular Graph having 12 edges.

 A 3 B 6 C 4 D Information given is insufficient
Question 3 Explanation:
Sum of degrees of all the edges equal to 2 times the number of edges. 2*12=4*n, n=>6.

 Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following statement is true.
 A There exists a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9 B There exists a MultiGraph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9 C There exists a MultiGraph as well as a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9 D None of the mentioned
Question 4 Explanation:
If a vertex has a degree 9 that means it is connected to all the other vertices, in case of Multigraphs for an isolate verte, x and a multiple edge may compensate.

 Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Given Adjacency matrices determine which of them are PseudoGraphs?

i) {{1, 0} {0, 1}}

ii) {{0, 1}{1, 0}}

iii) {{0, 0, 1}{0, 1, 0}{1, 0, 0}}

 A only i) B ii) and iii) C i) and iii) D i) ii) and iii)
Question 5 Explanation:
In i) self loops exist for both the vertices, in iii) self loop exists in the second vertex.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>