Pegging graphs yields a small diameter

DOI10.1017/S096354831000026XMaRDI QIDQ3081329zbMATH OpenFDO

Authors Stefanie Gerke, Angelika Steger, Nicholas Wormald

Publication date 7 March 2011

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096354831000026X

zbMATH Keywords

cubic graphsdiameter of graphdistance in graphsrandom graph processregular graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Short cycle distribution in random regular graphs recursively generated by pegging
• Connectivity of random regular graphs generated by the pegging algorithm
• An Explicit Construction of Lower-Diameter Cubic Graphs
• Generating random regular graphs
• Sampling Regular Graphs and a Peer-to-Peer Network

Cites work

• Short cycle distribution in random regular graphs recursively generated by pegging
• The Diameter of a Cycle Plus a Random Matching

Cited in

(1)

• Short cycle distribution in random regular graphs recursively generated by pegging

This page was built for publication: Pegging graphs yields a small diameter

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