On the average path length of a cycle plus random edges

DOI10.1016/J.ENDM.2015.07.048MaRDI QIDQ324818zbMATH OpenOpenAlexFDO

Authors S. M. O. H. Taha, Dimbinaina Ralaivaosaona

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.07.048

zbMATH Keywords

average path lengthmartingalesrandom graphrandom processsmall-world network

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The Diameter of a Cycle Plus a Random Matching
• Geodesics and almost geodesic cycles in random regular graphs
• Geodesic cycles in random graphs
• scientific article; zbMATH DE number 3916307
• Cycle lengths in sparse random graphs

Cites work

• Collective dynamics of `small-world' networks
• Discrete small world networks
• The Diameter of a Cycle Plus a Random Matching
• The diameter of randomly perturbed digraphs and some applications
• Weighted sums of certain dependent random variables

Cited in

(4)

• Effect of random edge failure on the average path length
• On the average length of lexicographic paths
• Random Walks on Regular and Irregular Graphs
• Variation of Adriatic and Wiener indices for different cycle lengths and paths

This page was built for publication: On the average path length of a cycle plus random edges

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