Degree sums and dense spanning trees

Tao Li, Yingqi Gao, Qiankun Dong, Hua Wang, Jianhua Tu
2017 PLoS ONE  
Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to formulate some general conditions on the sum of vertex degrees. We analyze the performance of various combinations of these degree sum conditions in finding dense spanning subtrees and apply our approach to practical examples. After briefly
more » ... ing our algorithm we also show how it can be used on variations of DST, motivated by variations of MST. Our work provide some insights on the role of various degree sums in forming dense spanning trees and hopefully lay the foundation for finding fast algorithms or heuristics for related problems.
doi:10.1371/journal.pone.0184912 pmid:28926585 pmcid:PMC5605090 fatcat:a4cy5k6zkbexbilg3btqgtjwei