Connectivity of random regular graphs generated by the pegging algorithm

DOI10.1002/JGT.20472MaRDI QIDQ3069674zbMATH OpenOpenAlexFDO

Authors Pu Gao

Publication date 19 January 2011

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20472

zbMATH Keywords

connectivitypegging algorithmrandom regular graphs

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Short cycle distribution in random regular graphs recursively generated by pegging
• Generating Random Regular Graphs Quickly
• Generating random regular graphs
• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• Connectedness of graphs generated by a random d-process

Cites work

• Emergence of Scaling in Random Networks
• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• Sampling Regular Graphs and a Peer-to-Peer Network
• Short cycle distribution in random regular graphs recursively generated by pegging
• The asymptotic connectivity of labelled regular graphs
• The diameter of a scale-free random graph

Cited in

(7)

• Investigating the existence and the regularity of logarithmic Harary graphs
• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• Pegging graphs yields a small diameter
• r 3: Resilient Random Regular Graphs
• Short cycle distribution in random regular graphs recursively generated by pegging
• Sampling Regular Graphs and a Peer-to-Peer Network
• Degree-preserving graph dynamics: a versatile process to construct random networks

This page was built for publication: Connectivity of random regular graphs generated by the pegging algorithm

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