On the number of cycles in a random non-equiprobable graph

DOI10.1515/dma.1992.2.1.109zbMath0778.05076OpenAlexW2094900528MaRDI QIDQ4713209

V. I. Khokhlov, V. F. Kolchin

Publication date: 25 June 1992

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1992.2.1.109

zbMATH Keywords

number of cyclesnonequiprobable random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items

Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns, Совместность случайных систем уравнений с неравновероятной выборкой двузначных неизвестных