Menu

Question Discussion & Solution

MCQ
Q.
Which of the following properties does a simple graph not hold?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
A __________ is a round trip path along n edges of G that visits every vertex once and returns to its starting position.
forum Discussion
MCQ
2.
The minimum number of edges required to create a cyclic graph of n vertices is
forum Discussion
MCQ
3.
In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
forum Discussion
MCQ
4.
If the graph is represented as an adjacency matrix then the time complexity of Kruskal
forum Discussion
MCQ
5.
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward