Geodesic
Upper complexity bounds for an infinite family of graph-manifolds
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 5 (2008), pp. 215-228

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: Matveev's complexity, graph-manifolds. 
@article{SEMR_2008_5_a17,
     author = {E. A. Fominykh},
     title = {Upper complexity bounds for an infinite family of graph-manifolds},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {215--228},
     publisher = {mathdoc},
     volume = {5},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2008_5_a17/}
}
TY  - JOUR
AU  - E. A. Fominykh
TI  - Upper complexity bounds for an infinite family of graph-manifolds
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2008
SP  - 215
EP  - 228
VL  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2008_5_a17/
LA  - ru
ID  - SEMR_2008_5_a17
ER  - 
%0 Journal Article
%A E. A. Fominykh
%T Upper complexity bounds for an infinite family of graph-manifolds
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2008
%P 215-228
%V 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2008_5_a17/
%G ru
%F SEMR_2008_5_a17
E. A. Fominykh. Upper complexity bounds for an infinite family of graph-manifolds. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 5 (2008), pp. 215-228. http://geodesic.mathdoc.fr/item/SEMR_2008_5_a17/