Question

Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

a.

3, Infinite, 4

b.

4, 3, Infinite

c.

4, Infinite, infinite

d.

4, Infinite, Infinite

Posted under Graphs Data Structures and Algorithms

Answer: (d).4, Infinite, Infinite

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

Add Comment

Similar Questions

Discover Related MCQs

Q. What is the maximum number of edges in a bipartite graph having 10 vertices?

View solution

Q. Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

View solution

Q. In BFS, how many times a node is visited?

View solution

Q. Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)

View solution

Q. When the Breadth First Search of a graph is unique?

View solution

Q. What can be the applications of Breadth First Search?

View solution

Q. A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

View solution

Q. The Breadth First Search traversal of a graph will result into?

View solution

Q. Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

View solution

Q. Breadth First Search is equivalent to which of the traversal in the Binary Trees?

View solution

Q. In Depth First Search, how many times a node is visited?

View solution

Q. Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)

View solution

Q. When the Depth First Search of a graph is unique?

View solution

Q. What can be the applications of Depth First Search?

View solution

Q. A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

View solution

Q. The Depth First Search traversal of a graph will result into?

View solution

Q. The Data structure used in standard implementation of Breadth First Search is?

View solution

Q. Time Complexity of DFS is? (V – number of vertices, E – number of edges)

View solution

Q. Depth First Search is equivalent to which of the traversal in the Binary Trees?

View solution

Q. Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?

View solution

View All MCQs on Graphs

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...