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

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-11
Main Authors: 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: Article
Language:English
Subjects:
Apexes
Security
Trees (mathematics)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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