Ir al contenido

Documat


Branch duplication in trees

  • Johnson, Charles R. [3] ; Lettie, Jacob [1] ; Mack-Crane, Sander [2] ; Szabelska-Beręsewicz, Alicja [4]
    1. [1] Duke University

      Duke University

      Township of Durham, Estados Unidos

    2. [2] Case Western Reserve University

      Case Western Reserve University

      City of Cleveland, Estados Unidos

    3. [3] The College of William and Mary.
    4. [4] Poznan University of Life Sciences.
  • Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 39, Nº. 2, 2020, págs. 451-465
  • Idioma: inglés
  • DOI: 10.22199/issn.0717-6279-2020-02-0028
  • Enlaces
  • Resumen
    • 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.

  • Referencias bibliográficas
    • C. R. Johnson and C. M. Saiago, “Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree”,...
    • C. R. Johnson and C. M. Saiago, “Diameter minimal trees”, Linear and multilinear algebra, vol. 64, no. 3, pp. 557–571, 2015, doi: 10.1080/03081087.2015.1057097.
    • A. Leal-Duarte and C. R. Johnson, “On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree”, Mathematical...
    • The R Fundation, “The R Project for Statistical Computing”, R-project, 2016. [Online]. Available: https://www.r-project.org/.

Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno