0 votes 0 votes Algorithms algorithms spanning-tree + – gshivam63 asked May 19, 2016 • retagged Jun 21, 2022 by makhdoom ghaya gshivam63 3.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Edge disjoint spanning trees are spanning trees that do not have any edges in common. Kn has n(n-1)/2 edges ,and each spanning has n-1 edges so there are at most Floor[n/2] edges disjoint spanning tree. ManojK answered May 19, 2016 ManojK comment Share Follow See all 4 Comments See all 4 4 Comments reply gshivam63 commented May 19, 2016 reply Follow Share Why floor[n/2] and not ceil[n/2]..can you please explain in detail 0 votes 0 votes ManojK commented May 19, 2016 reply Follow Share Consider K3 graph it has 1 edge disjoint spanning tree if u will take ceil then u will get 2 edge disjoint spanning tree which is not possible. 0 votes 0 votes Mayank Verma commented Jul 8, 2018 reply Follow Share but in k5 3 edges are disjoint spanning 0 votes 0 votes Shubham Shukla 6 commented Jul 8, 2018 reply Follow Share no for K5 you have 2 disjoint edge spanning tree... 0 votes 0 votes Please log in or register to add a comment.
