Characterization of Trees with Maximum Security.
Saved in:
| Title: | Characterization of Trees with Maximum Security. |
|---|---|
| Authors: | Alochukwu, Alex1, Dossou-Olory, Audace2, Osaye, Fadekemi Janet3, Rakotonarivo, Valisoa R. M.4, Ravichandran, Shashank5, Selkirk, Sarah J.6, Wang, Hua7, Whitlatch, Hays8 |
| Source: | Discrete Mathematics & Theoretical Computer Science (DMTCS). 2026, Vol. 28 Issue 2, p1-19. 19p. |
| Subjects: | Tree graphs, Graph theory |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
