A. A. Kochkarov, L. I. Sennikova, “Some prefractal graph's connectivity characteristics estimations”, Prikl. Diskr. Mat., 2011, no. 4(14), 56

Loading [MathJax]/jax/output/SVG/config.js

Prikladnaya Diskretnaya Matematika

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Prikladnaya Diskretnaya Matematika, 2011, Number 4(14), Pages 56–61 (Mi pdm343)

This article is cited in 3 scientific papers (total in 3 papers)

Applied Graph Theory

Some prefractal graph's connectivity characteristics estimations

A. A. Kochkarov^a, L. I. Sennikova^b

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

Full-text PDF (575 kB) Citations (3)

References:

PDF

HTML

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.

Document Type: Article

UDC: 519.17

Language: Russian

Citation: A. A. Kochkarov, L. I. Sennikova, “Some prefractal graph's connectivity characteristics estimations”, Prikl. Diskr. Mat., 2011, no. 4(14), 56–61

Citation in format AMSBIB

\Bibitem{KocSen11}

\by A.~A.~Kochkarov, L.~I.~Sennikova

\paper Some prefractal graph's connectivity characteristics estimations

\jour Prikl. Diskr. Mat.

\yr 2011

\issue 4(14)

\pages 56--61

\mathnet{http://mi.mathnet.ru/pdm343}

Linking options:

https://www.mathnet.ru/eng/pdm343

https://www.mathnet.ru/eng/pdm/y2011/i4/p56

This publication is cited in the following 3 articles:

Kochkarov A.A., “Modelirovanie strukturno-dinamicheskikh protsessov v setetsentricheskikh sistemakh monitoringa”, Antenny, 2013, no. 1, 164–168
Bairamukova Z.Kh., Kochkarov A.M., “Algoritm vychisleniya opredelitelei predfraktalnykh grafov s polnymi zatravkami, sokhranyayuschikh smezhnost starykh reber”, Politematicheskii setevoi elektronnyi nauchnyi zhurnal kubanskogo gosudarstvennogo agrarnogo universiteta, 2013, no. 87, 1–11 Algoritm of calculation of determinants of prefractal graphs with the full primers, keeping old edges contiguity
L. I. Sennikova, A. A. Kochkarov, “Parallelnyi algoritm poiska ostovnogo dereva minimalnogo vesa na predfraktalnom grafe”, PDM. Prilozhenie, 2012, no. 5, 95–97

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	348
Full-text PDF :	155
References:	64

Registration to the website

Logotypes