RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2011 Number 4(14), Pages 56–61 (Mi pdm343)

This article is cited in 3 papers

Applied Graph Theory

Some prefractal graph's connectivity characteristics estimations

A. A. Kochkarova, L. I. Sennikovab

a M. V. Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, Moscow, Russia
b Stavropol Institute of Management, Stavropol, Russia

Abstract: 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.

UDC: 519.17



© Steklov Math. Inst. of RAS, 2024