Question Discussion & Solution

MCQ

What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

n-2

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The minimum number of edges required to create a cyclic graph of n vertices is

n+1

n-1

Discussion

MCQ

When the Breadth First Search of a graph is unique?

When the graph is a Binary Tree

When the graph is a Linked List

When the graph is a n-ary Tree

None of the mentioned

Discussion

MCQ

Which of these adjacency matrices represents a simple graph?

[ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

[ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

[ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

[ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

Discussion

MCQ

Time complexity to find if there is an edge between 2 particular vertices is _________

O(V)

O(E)

O(1)

O(V+E)

Discussion

MCQ

For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

e^n

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics