+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following is a HyperGraph, where V is the set of vertices, E is the set of edges?

(a) V = {v1, v2, v3} E = {e1, e2} = {{v2, v3} {v1, v3}}

(b) V = {v1, v2} E = {e1} = {{v1, v2}}

(c) V = {v1, v2, v3} E = {e1, e2, e3} = {{v2, v3}{v3, v1}{v2, v1}}

(d) All of the mentioned

The origin of the question is Multigraph and Hypergraph topic in portion Graph of Data Structures & Algorithms I

The question was asked in an interview for job.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right choice is (d) All of the mentioned

For explanation: In a uniform Graph all the hyper-edges have the same cardinality.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...