Characterization of Trees with Maximum Security

Alex Alochukwu(corresponding author)
,
Audace Dossou-Olory
,
Fadekemi Janet Osaye
,
Valisoa R.M. Rakotonarivo
,
Shashank Ravichandran
,
Sarah J. Selkirk

*Corresponding author for this work

Albany State University
,
Université d’Abomey-Calavi
,
Troy University
,
University of Pretoria
,
University of Deleware
,
University of Klagenfurt

Research Output:

Contribution to journal

Article

Peer-review

Open access

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 proper binary trees, and produce a classification of families of proper binary trees for which the security is maximized. In addition, extremal results relating to the maximum rank among all vertices in families of trees are discussed

Access to documents

10.46298/dmtcs.14872

License:CC BY

Bibliographic Information

Output type

Research Output:

Contribution to journal

Article

Peer-review

Original language

English

Article number

Journal (Volume, Issue Number)

Discrete Mathematics and Theoretical Computer Science (Volume 28, Issue 2)

Publication milestones

Published - 2026

Publication status

Published - 2026

ISSN

1462-7264

Publication IDs

Scopus: 105036429137
Mendeley: b6f41cbc-d057-3fb4-9abd-f8bc812b0880