Menu

Question Discussion & Solution

MCQ
Q.
For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

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.
How many of the following statements are correct?i) All cyclic graphs are complete graphs.ii) All complete graphs are cyclic graphs.iii) All paths are bipartite.iv) All cyclic graphs are bipartite.v) There are cyclic graphs which are complete.
forum Discussion
MCQ
2.
An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?
forum Discussion
MCQ
3.
Incidence matrix and Adjacency matrix of a graph will always have same dimensions?
forum Discussion
MCQ
4.
The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is
forum Discussion
MCQ
5.
A Graph Structured Stack is a _____________
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs