Degree sums and dense spanning trees

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...

Full description

Saved in:
Bibliographic Details
Published in:PLoS One
Main Authors: Li, Tao, Gao, Yingqi, Dong, Qiankun, Wang, Hua
Format: Artigo
Language:Inglês
Published: Public Library of Science 2017
Subjects:
Research Article
Online Access:https://ncbi.nlm.nih.gov/pmc/articles/PMC5605090/
https://ncbi.nlm.nih.gov/pubmed/28926585
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0184912
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items