|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2004, Volume 7, Number 1, Pages 57–65
(Mi sjvm144)
|
|
|
|
On some characteristics of the multigraph arc coherence
M. I. Nechepurenko Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences
Abstract:
Papers [1–3] present values of the greatest arc coherence $\lambda(p,q)$ and the smallest number $B(p,q)$ of the power cuts $\lambda(p,q)$ for $(p,q)$-multigraphs. The present paper states the complete corrected proof of the results from [3], which brings about obtaining the asymptotic values of probabilities of coherence of one class of random multigraphs.
Key words:
multi-graph, minimum edge's connectivity, maximum edge's connectivity cuts.
Received: 28.02.2003
Citation:
M. I. Nechepurenko, “On some characteristics of the multigraph arc coherence”, Sib. Zh. Vychisl. Mat., 7:1 (2004), 57–65
Linking options:
https://www.mathnet.ru/eng/sjvm144 https://www.mathnet.ru/eng/sjvm/v7/i1/p57
|
Statistics & downloads: |
Abstract page: | 166 | Full-text PDF : | 65 | References: | 41 |
|