|
Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 68–70
(Mi pdm182)
|
|
|
|
Mathematical Foundations of Reliability of Computing and Control Systems
On minimal vertex 1-extensions of special form superslim trees
M. B. Abrosimov, D. D. Komarov Saratov State University, Saratov
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.
Citation:
M. B. Abrosimov, D. D. Komarov, “On minimal vertex 1-extensions of special form superslim trees”, Prikl. Diskr. Mat., 2010, supplement № 3, 68–70
Linking options:
https://www.mathnet.ru/eng/pdm182 https://www.mathnet.ru/eng/pdm/y2010/i12/p68
|
|