Geodesic
On some prefractal graphs properties
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 93-94 
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/
@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},
     year = {2011},
     number = {13},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a47/}
}
TY  - JOUR
AU  - A. A. Kochkarov
AU  - L. I. Sennikova
AU  - N. N. Bolurov
TI  - On some prefractal graphs properties
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 93
EP  - 94
IS  - 13
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_13_a47/
LA  - ru
ID  - PDM_2011_13_a47
ER  - 
%0 Journal Article
%A A. A. Kochkarov
%A L. I. Sennikova
%A N. N. Bolurov
%T On some prefractal graphs properties
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 93-94
%N 13
%U http://geodesic.mathdoc.fr/item/PDM_2011_13_a47/
%G ru
%F PDM_2011_13_a47

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.

[1] Kochkarov A. M., Raspoznavanie fraktalnykh grafov. Algoritmicheskii podkhod, RAN SAO, Nizhnii Arkhyz, 1998

[2] Kochkarov A. A., Kochkarov R. A., “Parallelnyi algoritm poiska kratchaishego puti na predfraktalnom grafe”, Zhurn. vychislit. matem. i matem. fiziki, 44:6 (2004), 1147–1152 | MR | Zbl