Characterization of Trees with Maximum Security

Characterization of Trees with Maximum Security

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-11
Hauptverfasser: Alochukwu, Alex S A, Audace A V Dossou-Olory, Osaye, Fadekemi J, Valisoa R M Rakotonarivo, Ravichandran, Shashank, Selkirk, Sarah J, Wang, Hua, Hays Whitlatch
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Security
Trees (mathematics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422