Classification of binary trees maximizing security (sum of vertex ranks) with additional extremal results on maximum rank.
Protected nodes and fringe subtrees in some random trees.Electron
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Characterization of Trees with Maximum Security
Classification of binary trees maximizing security (sum of vertex ranks) with additional extremal results on maximum rank.