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-TzbMATH Open0785.05078OpenAlexW2028279712MaRDI QIDQ685646FDOQ685646

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Degrees in a digraph whose nodes are graphs
• Title not available (Why is that?)

Recommendations

• Degrees in a digraph whose nodes are graphs 👍 👎
• A kinetic approach to the random \(f\)-graph process. Paths, cycles and components 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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\)

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