Generating random regular graphs

DOI10.1016/0196-6774(84)90030-0zbMath0543.68048OpenAlexW2016806840MaRDI QIDQ5896385

Nicholas C. Wormald

Publication date: 1984

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90030-0

zbMATH Keywords

algorithmregular graphsrandom labeled graphsrandom (0,1)-matrixrandom labeled bipartite graphsrandom labeled cubic graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Fast uniform generation of regular graphs ⋮ Random graphs with given vertex degrees and switchings ⋮ Dynamics of random graphs with bounded degrees ⋮ Uniform generation of temporal graphs with given degrees ⋮ Self-similarity of communities of the ABCD model ⋮ Uniform Generation of Random Regular Graphs ⋮ A separator-based method for generating weakly chordal graphs

This page was built for publication: Generating random regular graphs