Question Discussion & Solution

MCQ

A complete graph can have ...............

n^2 spanning trees

n^(n-2) spanning trees

n^(n+1) spanning trees

n^n spanning trees

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What are the dimensions of an incidence matrix?

Number of edges*number of edges

Number of edges*number of vertices

Number of vertices*number of vertices

None of the mentioned statements

Discussion

MCQ

Adjacency matrix of all graphs are symmetric.

May be

Can't say

Discussion

MCQ

In which of the following case does a Propositional Directed Acyclic Graph is used for?

Representation of Boolean Functions

String Matching

Searching

Sorting of number

Discussion

MCQ

Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

May be

Can't say

Discussion

MCQ

MultiGraphs having self-loops are called PseudoGraphs?

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