graph_doubt

Question

"edge disjoint spanning tree" means ?

Comments

edge-disjoint means edges doesn't have common vertex.

spanning graph is a graph with edges which doesn't have common vertex's.

 

but i didn't get why they call it as spanning tree with edge-disjoint because tree means connected acyclic graph but edge-disjoint means always disconnect.

---

@Shaik

because they are not single tree

https://math.stackexchange.com/questions/1158536/what-is-an-edge-disjoint-spanning-tree

 

---

@srestha,  Thank u mam...

 

Conclusion:-

for an unlabeled graph, there is only one set of n/2 trees 

for a labeled graph, there may be more than one set where each set contains n/2 trees.

Answer 1

The edge disjoint spanning tree is as