The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)

DOI10.1016/0012-365X(93)90352-TzbMath0785.05078OpenAlexW2028279712MaRDI QIDQ685646

Krystyna T. Balińska, Louis V. Quintas

Publication date: 24 October 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90352-t

zbMATH Keywords

probabilitiesvertex degree\(f\)-graphedge-maximal \(f\)-graphrandom \(f\)-graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

Degrees in a digraph whose nodes are graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)