On the number of cycles in a nonequiprobable random graph

zbMATH Open0757.05092MaRDI QIDQ3362289FDOQ3362289

Authors: V. F. Kolchin, V. I. Khokhlov 

Publication date: 1990

Recommendations

• On the number of cycles in a random non-equiprobable graph
• scientific article; zbMATH DE number 219310
• Random graph processes with maximum degree 2
• scientific article; zbMATH DE number 4082595
• scientific article; zbMATH DE number 1335045

zbMATH Keywords

number of cyclesnonequiprobable random graph

Mathematics Subject Classification ID

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

Cited In (14)

• Partitioning random graphs into large cycles
• Cycles and Unicyclic Components in Random Graphs
• A generating function approach to random subgraphs of the \(n\)-cycle
• The Cycling Property for the Clutter of Odd st-Walks
• Title not available (Why is that?)
• A generalization of Fan's results: Distribution of cycle lengths in graphs
• Title not available (Why is that?)
• Random cyclic triangle-free graphs of prime order
• The number of Euler tours of a random directed graph
• Exponential inequalities for the tail probabilities of the number of cycles in generalized random graphs
• Feasibility of numerical modelling: Information aspect
• Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs
• On the number of paths and cycles for almost all graphs and digraphs
• Title not available (Why is that?)

This page was built for publication: On the number of cycles in a nonequiprobable random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3362289)