EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Characterization of Trees with Maximum Security

Alex S. A. Alochukwu, Audace A. V. Dossou-Olory, Fadekemi J. Osaye, Valisoa R. M. Rakotonarivo, Shashank Ravichandran, Sarah J. Selkirk, Hua Wang, Hays Whitlatch

Discrete Mathematics & Theoretical Computer Science · 09.04.2026 · vol. 28:2 (Graph Theory)

DOI: 10.46298/dmtcs.14872 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 09.04.2026. Verfasst von Alex S. A. Alochukwu und 7 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the sum of ranks over all vertices (known as the security) in binary trees, and produce a classification of families of binary trees for which the security is maximized. In addition, extremal results relating to maximum rank among all vertices in families of trees is discussed. This work is an output of the American Mathematical Society's Mathematics Research Community (MRC): Trees in Many Contexts

Zitieren

APA

Alochukwu, A. S. A., Dossou-Olory, A. A. V., Osaye, F. J., Rakotonarivo, V. R. M., Ravichandran, S., Selkirk, S. J., Wang, H., & Whitlatch, H. (2026). Characterization of Trees with Maximum Security. Discrete Mathematics & Theoretical Computer Science, vol. 28:2(Graph Theory). https://doi.org/10.46298/dmtcs.14872

Vancouver

Alochukwu ASA, Dossou-Olory AAV, Osaye FJ, Rakotonarivo VRM, Ravichandran S, Selkirk SJ, et al. Characterization of Trees with Maximum Security. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:2(Graph Theory). doi:10.46298/dmtcs.14872

BibTeX
@article{Alochukwu2026,
  author = {Alochukwu, Alex S. A. and Dossou-Olory, Audace A. V. and Osaye, Fadekemi J. and Rakotonarivo, Valisoa R. M. and Ravichandran, Shashank and Selkirk, Sarah J. and Wang, Hua and Whitlatch, Hays},
  title = {Characterization of Trees with Maximum Security},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  year = {2026},
  volume = {vol. 28:2},
  number = {Graph Theory},
  doi = {10.46298/dmtcs.14872}
}
Kostenlos starten →