Abstract:
Tree is called superslim if all vertices except the root and leaves have degree 2. We consider the minimal vertex 1-extensions of superslim trees and provide a lower bound for the number of additional edges of minimal vertex 1-extensions of arbitrary superslim tree. We describe two families of superslim trees, for which lower bound is achieved.