+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?

(a) 21

(b) 7

(c) 6

(d) 49

My doubt stems from Directed Graph topic in chapter Graph of Data Structures & Algorithms I

This question was posed to me in quiz.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
The correct choice is (c) 6

For explanation: If the no cycles exists then the difference between the number of vertices and edges is 1.

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

...