2 votes 2 votes How many edge disjoint spanning trees are possible for a undirected complete connected graph of n vertices? Algorithms algorithms minimum-spanning-tree graph-theory made-easy-test-series + – Sambhrant Maurya asked Aug 13, 2018 • retagged Jul 15, 2022 by Anjana5051 Sambhrant Maurya 664 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Edge disjoint spanning trees: Spanning trees where no two trees in the set have an edge in common. So it is a property of pairs of trees, not a single tree. For a tree with n nodes its n/2. Source: https://math.stackexchange.com/questions/1158536/what-is-an-edge-disjoint-spanning-tree smsubham answered Aug 13, 2018 • selected Dec 16, 2019 by Sambhrant Maurya smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
