On some prefractal graphs properties
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 93-94
Voir la notice de l'article provenant de la source Math-Net.Ru
This paper is devoted to some structural properties of prefractal graphs. A procedure for generating prefractal graphs is described. Upper and least bounds for the number of cutpoints and bridges in prefractal graphs are given.
@article{PDM_2011_13_a47,
author = {A. A. Kochkarov and L. I. Sennikova and N. N. Bolurov},
title = {On some prefractal graphs properties},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {93--94},
publisher = {mathdoc},
number = {13},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a47/}
}
A. A. Kochkarov; L. I. Sennikova; N. N. Bolurov. On some prefractal graphs properties. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 93-94. http://geodesic.mathdoc.fr/item/PDM_2011_13_a47/