Skip to main content
Presentation
Binary Trees With the Largest Number of Subtrees With at Least One Leaf
Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) (2005)
  • Hua Wang, Georgia Southern University
Abstract
This talk was given during the Southeastern International Conference on Combinatorics, Graph Theory, and Computing.
Keywords
  • Binary trees,
  • Subtrees with at least one leaf
Disciplines
Publication Date
March, 2005
Location
Boca Raton, FL
Citation Information
Hua Wang. "Binary Trees With the Largest Number of Subtrees With at Least One Leaf" Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) (2005)
Available at: http://works.bepress.com/hua_wang/152/