in Graph Theory
5,241 views
5 votes
5 votes
in Graph Theory
by
5.2k views

4 Comments

if edge weights are not distinct minimum spanning tree can be more than one.
1
1
yes it can be more than one when all nodes have same weight then no of spanning tree will be equal to number of edges.

but sir how to calculate minimum number of spanning tree .There is only one thing is given that is number of nodes?
0
0
Actually the question is wrong.

spanning tree - is defined for Graph

connected tree - a tree is be definition connected.

And minimum no. of spanning tree in a connected graph should be 1- consider a line graph.
4
4

Please log in or register to answer this question.

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