Froncek and Kovarova provided in [2] and [3] spanning trees of order 2n that factorize K_(2n) for every n ≥ 2 and for every feasible diameter d, 3 ≤ d ≤ 2n - 1. We extend their work and give a spanning tree on 2n vertices with a maximum degree Δ that factorize K_(2n) for every n ≥ 2 and for every feasible 2 ≤ Δ ≤ n. We give a construction for both symmetric and non-symmetric spanning trees.
展开▼
