Alex S. A. Alochukwu (1), Audace A. V. Dossou-Olory (2), Fadekemi J. Osaye (3), Valisoa R. M. Rakotonarivo (4), Shashank Ravichandran (5), Sarah J. Selkirk (6) (7), Hua Wang (8), Hays Whitlatch (9)
Alex S. A. Alochukwu (1), Audace A. V. Dossou-Olory (2), Fadekemi J. Osaye (3), Valisoa R. M. Rakotonarivo (4), Shashank Ravichandran (5), Sarah J. Selkirk (6) (7), Hua Wang (8), Hays Whitlatch (9)
(1) Albany State University [ASU]
(2) Université d'Abomey-Calavi [UAC]
(3) Troy University
(4) University of Pretoria [UP]
(5) University of Delaware [UD]
(6) University of Klagenfurt [AAU]
(7) University of Warwick
(8) Georgia Southern University
(9) Gonzaga University [GU]
Abstract
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
