Skip to search boxSkip to navigationSkip to main content
Logo Gonzaga University

Characterization of Trees with Maximum Security

  • Alex Alochukwug(Author)
    ,
  • Audace Dossou-Oloryh(Author)
    ,
  • Fadekemi Janet Osayei(Author)
    ,
  • Valisoa R.M. Rakotonarivod(Author)
    ,
  • Shashank Ravichandranb(Author)
    ,
  • Sarah J. Selkirke, f(Author)
  • aMathematics
    ,
  • bUniversity of Deleware
    ,
  • cGeorgia Southern University
    ,
  • dUniversity of Pretoria
    ,
  • eUniversity of Klagenfurt
    ,
  • fUniversity of Warwick
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