Cargando…

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

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Tao, Gao, Yingqi, Dong, Qiankun, Wang, Hua
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5605090/
https://www.ncbi.nlm.nih.gov/pubmed/28926585
http://dx.doi.org/10.1371/journal.pone.0184912

Ejemplares similares