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.

UDC: 519.17

Received: 28.02.2003

Bibliographic databases:

•