Geodesic
Some prefractal graph's connectivity characteristics estimations
Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 56-61

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

The paper is devoted to the research of prefractal graph's connectivity characteristics. Some estimations being achievable on their boundaries are received for the number of prefractal graph's cutpoints and bridges. The estimations are obliged to the self-similarity of prefractal graphs.
Keywords: self-similar graphs, fractal and prefractal graphs, network systems, cutpoints and bridges. 
@article{PDM_2011_4_a6,
     author = {A. A. Kochkarov and L. I. Sennikova},
     title = {Some prefractal graph's connectivity characteristics estimations},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {56--61},
     publisher = {mathdoc},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_4_a6/}
}
TY  - JOUR
AU  - A. A. Kochkarov
AU  - L. I. Sennikova
TI  - Some prefractal graph's connectivity characteristics estimations
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 56
EP  - 61
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_4_a6/
LA  - ru
ID  - PDM_2011_4_a6
ER  - 
%0 Journal Article
%A A. A. Kochkarov
%A L. I. Sennikova
%T Some prefractal graph's connectivity characteristics estimations
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 56-61
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_4_a6/
%G ru
%F PDM_2011_4_a6
A. A. Kochkarov; L. I. Sennikova. Some prefractal graph's connectivity characteristics estimations. Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 56-61. http://geodesic.mathdoc.fr/item/PDM_2011_4_a6/