Characterization of trees with maximum security

DOI10.46298/DMTCS.14872MaRDI QIDQ7364480zbMATH OpenFDO

Authors Audace A. V. Dossou-Olory, F. J. Osaye, Valisoa R. M. Rakotonarivo, Shashank Ravichandran, Sarah J. Selkirk, Hua Wang, Hays Whitlatch

Publication date 2 October 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.14872

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites work

• k-protected vertices in binary search trees
• \(k\)-protected vertices in unlabeled rooted plane trees
• Asymptotic distribution of two-protected nodes in random binary search trees
• Asymptotic distribution of two-protected nodes in ternary search trees
• Asymptotic properties of protected nodes in random recursive trees
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Notes on protected nodes in digital search trees
• On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM
• On subtrees of trees
• On the number of 2-protected nodes in tries and suffix trees
• On the peel number and the leaf-height of Galton–Watson trees
• Protected nodes and fringe subtrees in some random trees
• Protected points in \(k\)-ary trees
• Protected points in ordered trees
• Protection number in plane trees
• Protection number of recursive trees
• Protection numbers in simply generated trees and Pólya trees
• The distribution of the maximum protection number in simply generated trees

This page was built for publication: Characterization of trees with maximum security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364480)