## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Multigraph and Hypergraph

Question 1 |

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}}

only i) | |

ii) and iii) | |

i) and iii) | |

i) ii) and iii) |

**Biology Questions answers**

Question 1 Explanation:

In i) self loops exist for both the vertices, in iii) self loop exists in the second vertex.

Question 2 |

All undirected Multigraphs contain eulerian cycles.

True | |

False |

**NTA NET Questions answers**

Question 2 Explanation:

Only graphs with every vertex having even degree have eulerian circuits or cycles.

Question 3 |

Determine the number of vertices for the given Graph or Multigraph?

G is a 4-regular Graph having 12 edges.

3 | |

6 | |

4 | |

Information given is insufficient |

**UPSC GS Questions answers**

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 |

Which of the following statement is true.

There exists a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9 | |

There exists a MultiGraph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9 | |

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 | |

None of the mentioned |

**Reading comprehension Questions answers**

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 |

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}}

only i) | |

ii) and iii) | |

i) and iii) | |

i) ii) and iii) |

**Biology Questions answers**

Question 5 Explanation:

In i) self loops exist for both the vertices, in iii) self loop exists in the second vertex.

There are 5 questions to complete.