## Articulo

• Similares en SciELO

## versión impresa ISSN 0716-0917

### Proyecciones (Antofagasta) vol.39 no.2 Antofagasta abr. 2020

#### http://dx.doi.org/10.22199/issn.0717-6279-2020-02-0028

Artículos

Branch duplication in trees: uniqueness of sedes and enumeration of sedes

1The College of William and Mary, Dept. of Mathematics, Williamsburg, VA, U.S.A.: e-mail: crjohn@wm.edu

2Duke University, Dept.of Mathematics, Durham, NC, U.S.A. e-mail: jrl47@duke.edu

3Case Western Reserve University, Dept. of Mathematics, Applied Mathematics and Statistics, Cleveland, OH, U.S.A. e-mail: mack-crane@case.edu

4Poznan University of Life Sciences, Dept. of Mathematical and Statistical Methods, Poznan, Poland. e-mail: aszabelska@gmail.com

Abstract

By the process of branch duplication, any tree may be generated from a type of tree called a seed. We describe the correspondence between trees and seeds by showing that each tree grows from a unique seed and giving an algorithm to produce this seed. Using results about the structure of seeds, we enumerate the seeds of a given diameter.

Keywords: Branch duplication in tres; Enumeration of sedes; Rooted tres; Seeds; Uniqueness of seeds

Acknowledgements

This work was supported by NSF grant DMS 075 1964.

References

[1] C. R. Johnson and C. M. Saiago, “Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree”,Linear and multilinear algebra, vol. 56, no. 4, pp. 357-380, 2008, doi: 10.1080/03081080600597668. [ Links ]

[2] C. R. Johnson andC. M. Saiago , “Diameter minimal trees”, Linear and multilinear algebra, vol. 64, no. 3, pp. 557-571, 2015, doi: 10.1080/03081087.2015.1057097. [ Links ]

[3] A. Leal-Duarte andC. R. Johnson , “On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree”,Mathematical Inequalities & Applications, vol. 5, no. 2, pp. 175-180, 2002, doi: 10.7153/mia-05-19. [ Links ]

[4] The R Fundation, “The R Project for Statistical Computing”, R-project, 2016. [Online]. Available: https://www.r-project.org/. [ Links ]

Received: June 30, 2019; Accepted: November 30, 2019