Верхние оценки сложности для бесконечной серии граф-многообразий

We provide a new formula for an upper bound of complexity of closed connected graph-manifolds obtained by gluing together two Seifert manifolds fibered over the disc with two exceptional fibers and a Seifert manifolds fibered over the annulus with one exceptional fiber. This bound turns out to be sharp for all such manifolds up to complexity 12.