The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged spanningtree
0
votes
1
answer
1
MadeEasy Test Series 2019: Algorithms  Spanning Tree
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu vl then the minimum cost of the spanning tree of G_ 36
asked
Jan 30
in
Algorithms
by
Ram Swaroop
Active
(
2.6k
points)

123
views
algorithms
spanningtree
madeeasytestseries2019
madeeasytestseries
0
votes
2
answers
2
Ace test series question on number of spanning trees possible
asked
Jan 24
in
Algorithms
by
Shankar Kakde
(
373
points)

74
views
spanningtree
0
votes
1
answer
3
GATE Minimum Spanning Trees
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?
asked
Aug 31, 2018
in
Mathematical Logic
by
Nidhi Budhraja
(
263
points)

126
views
minimumspanningtrees
spanningtree
graphtheory
graphalgorithms
algorithms
+1
vote
3
answers
4
Doubt
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
asked
Aug 23, 2018
in
Graph Theory
by
Rishav Kumar Singh
Loyal
(
5.5k
points)

116
views
spanningtree
0
votes
1
answer
5
Made Easy algorithms
How many edge disjoint spanning trees are possible for a undirected complete connected graph of n vertices?
asked
Aug 13, 2018
in
Algorithms
by
Sambhrant Maurya
Active
(
1.7k
points)

106
views
algorithms
spanningtree
graphtheory
+4
votes
1
answer
6
Number of spanning tress
How do we come up with this formula for number of spanning tree of a n vertex complete graph Kn= $n^{n2}$
asked
Mar 18, 2018
in
Algorithms
by
Mahendra Singh Kanya
(
417
points)

259
views
spanningtree
algorithms
graphtheory
0
votes
4
answers
7
trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?
asked
Feb 19, 2018
in
DS
by
Parimal Paritosh
(
323
points)

223
views
binarytree
algorithms
spanningtree
binarysearchtree
+3
votes
1
answer
8
#distinct MSTs
......................................................
asked
Jan 28, 2018
in
Algorithms
by
Tuhin Dutta
Loyal
(
9.6k
points)

169
views
algorithms
mst
spanningtree
+5
votes
2
answers
9
Number of minimum spanning trees
asked
Jan 18, 2018
in
Graph Theory
by
vishal chugh
Active
(
1.8k
points)

640
views
spanningtree
graphtheory
minimumspanningtrees
+2
votes
0
answers
10
TEST SERIES
Consider the following graph and Assume node ‘P’ as the starting vertex for Prim’s algorithm. Which of the following can be the correct order of edges to which they are added to construct Minimum Spanning Tree (MST)? PQ, QR, RW, RS, VX, VU, WV, ST PQ, QR, RW, WV, VX, VU, RS, ST PQ, PX, XV, VU, UR, RS, RW, ST PQ, PX, XV, VU, UR, RW, RS, ST PLEASE EXPLAIN.
asked
Jan 8, 2018
in
Algorithms
by
ankit_thawal
Active
(
2.1k
points)

234
views
primsalgorithm
spanningtree
minimumspanningtrees
greedyalgorithm
+2
votes
0
answers
11
Ace Test series: Algorithms  Spanning Tree
Am getting 7. The answer given is 10. A  B , A  D , D  E , E  C are the edges i have included.
asked
Jan 6, 2018
in
Algorithms
by
smsubham
Loyal
(
9.3k
points)

61
views
acetestseries
graphalgorithms
algorithms
spanningtree
minimumspanningtrees
+5
votes
1
answer
12
How many MST is possible?
Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___? My answer was 1 and given is 2 ,what I am missing ? Edit:I had confirmed with it and answer is only one tree possible.
asked
Jan 2, 2018
in
Algorithms
by
sunil sarode
Active
(
1.5k
points)

391
views
algorithms
spanningtree
kruskalsalgorithm
primsalgorithm
+1
vote
0
answers
13
MadeEasy Test Series: Algorithms  Spanning Tree
can someone provide a detailed solution of this??
asked
Jan 1, 2018
in
Algorithms
by
Kalpataru Bose
Junior
(
507
points)

195
views
madeeasytestseries
algorithms
graphalgorithms
spanningtree
minimumspanningtrees
greedyalgorithm
+3
votes
1
answer
14
Spannig trees
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
asked
Nov 17, 2017
in
Graph Theory
by
Parshu gate
Active
(
5.1k
points)

473
views
spanningtree
graphtheory
+3
votes
0
answers
15
Number of spanning Trees
Hi, As all of us knows number of spanning tree of simple labeled graph could be computed by the Kirchhoff's theorem. But is there any other method (other than Brute force) to compute the number of spanning tree of given general graph ? Formula for number ... respectively. If anyone can state simple proof for above mentioned formula then it will great help.
asked
Nov 15, 2017
in
Graph Theory
by
Chhotu
Boss
(
12.4k
points)

1k
views
spanningtree
algorithms
graphtheory
0
votes
1
answer
16
UGCNETdec2008ii3
The total number of spanning trees that can be drawn using five labeled vertices is: (A) 125 (B) 64 (C) 36 (D) 16
asked
Sep 25, 2017
in
DS
by
rishu_darkshadow
Loyal
(
7.9k
points)

425
views
ugcnetdec2008ii
datastructure
spanningtree
0
votes
1
answer
17
Basic Doubt in spanning tree complexity
Let us say Simple graph has V vertices and E edges. Now i am trying to find relation between E and V. If it is a complete graph ,then E=V(V1)/2, => E=$c.V^2$ => E=$O(V^2)$ => taking log of both sides. => $\log E$=$O(\log V)$ ... .(3) Can someone confirm if the 1 ,2 and the result of them i.e the 3rd equation is valid ?
asked
Sep 16, 2017
in
Algorithms
by
rahul sharma 5
Boss
(
27.2k
points)

185
views
spanningtree
timecomplexity
+1
vote
1
answer
18
[Discrete maths] Spanning trees
True/False; 1. Every tree is spanning tree.
asked
Sep 16, 2017
in
Graph Theory
by
rahul sharma 5
Boss
(
27.2k
points)

189
views
algorithms
spanningtree
minimumspanningtrees
+2
votes
2
answers
19
Graph Theory
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST? a) Yes b) no c) cant say
asked
Sep 14, 2017
in
Graph Theory
by
Rakshit Gupta
(
33
points)

211
views
graphtheory
graphmatching
graphconnectivity
spanningtree
+1
vote
1
answer
20
How many Spanning Trees are possible from the graph?
How many Spanning Trees are possible from the graph given below? (a) 24 (b) 34 (c) 44 (d) 54
asked
May 3, 2017
in
Algorithms
by
targate2018
Active
(
1.8k
points)

824
views
algorithms
spanningtree
+2
votes
2
answers
21
No of spanning Trees
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such a way that no two of these spanning trees have a common edge.
asked
Mar 19, 2017
in
Graph Theory
by
Debashish Deka
Veteran
(
58k
points)

727
views
spanningtree
graphtheory
0
votes
1
answer
22
testbook
asked
Feb 7, 2017
in
Theory of Computation
by
Sarvottam Patel
Active
(
1.1k
points)

119
views
spanningtree
–1
vote
3
answers
23
Virtual Gate Test Series: Algorithms  Minimum Spanning Tree
I think all options are wrong
asked
Jan 11, 2017
in
Algorithms
by
Purple
Active
(
3.6k
points)

253
views
algorithms
spanningtree
minimumspanningtrees
primsalgorithm
virtualgatetestseries
+2
votes
1
answer
24
DAA: number of spanning Trees
I am getting 128 as answer: 8 Spanning trees in first part(LHS) * 2 choice in middle Part * 8 Spanning trees in Second part(RHS), but given answer is 256:
asked
Jan 2, 2017
in
Algorithms
by
Vijay Thakur
Boss
(
17.3k
points)

382
views
spanningtree
algorithms
+1
vote
2
answers
25
GATE19894vii
Provide short answers to the following questions: In the graph shown above, the depthfirst spanning tree edges are marked with a 'T'. Identify the forward, backward and cross edges.
asked
Nov 30, 2016
in
Graph Theory
by
makhdoom ghaya
Boss
(
41.2k
points)

258
views
gate1989
descriptive
graphtheory
spanningtree
+1
vote
1
answer
26
UGCNETAUG2016III33
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4  i – j$. The weight of minimum cost spanning tree of $G$ is : $4n^{2}$ $n$ $4n – 4$ $2n – 2$
asked
Oct 1, 2016
in
Others
by
makhdoom ghaya
Boss
(
41.2k
points)

306
views
ugcnetaug2016iii
datastructure
spanningtree
0
votes
0
answers
27
Virtual Gate Test Series: Algorithms  Spanning Tree
asked
Jul 15, 2016
in
Algorithms
by
debanjan sarkar
Active
(
4.1k
points)

152
views
algorithms
spanningtree
minimumspanningtrees
virtualgatetestseries
+5
votes
4
answers
28
ISRO201541
The number of spanning trees for a complete graph with seven vertices is $2^5$ $7^5$ $3^5$ $2^{2 \times 5}$
asked
Jun 5, 2016
in
Algorithms
by
shivanisrivarshini
Boss
(
14.3k
points)

3.4k
views
isro2015
graphtheory
spanningtree
+1
vote
0
answers
29
ISI2012CS4
A fan of order $n$ is a graph on the vertices $\{0, 1, \dots, n\}$ with 2n − 1 edges defined as follows: vertex 0 is connected by an edge to each of the other $n$ vertices, and vertex $i$ ... the number of spanning trees of the fan of order $n$. Calculate $f_4$. Write a recurrence for $f_n$. Solve for fn using ordinary generating fuctions.
asked
Jun 2, 2016
in
Graph Theory
by
jothee
Veteran
(
116k
points)

191
views
descriptive
isi2012
graphtheory
spanningtree
generatingfunctions
+1
vote
1
answer
30
ISI2014CS3b
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
116k
points)

201
views
descriptive
isi2014
algorithms
spanningtree
graphalgorithms
Page:
1
2
3
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Kanpur MS Interview experience
My GATE preparation and what you can learn from it
IIT Bombay RA (2019) Programming Questions
COAP Round 1 has started
MTECH (COUURSE WORK) AI INTERVIEW EXPERIENCE 2019
Follow @csegate
Recent questions tagged spanningtree
Recent Blog Comments
Congratulations on your achievement🍰, it will...
Allowed languages?
Thanks a TON brother.. :)
49,400
questions
53,575
answers
185,758
comments
70,852
users