Question Discussion & Solution

MCQ

All undirected Multigraphs contain eulerian cycles.

May be

Can't say

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

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

If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________

(n*n-n-2*m)/2

(n*n+n+2*m)/2

(n*n-n-2*m)/2

(n*n-n+2*m)/2

Discussion

MCQ

Identify the correct problem for multistage graph from the list given below.

Resource allocation problem

Traveling salesperson problem

Producer consumer problem

Barber

Discussion

MCQ

Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?

Discussion

MCQ

Dijkstra

May be

Can't say

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