A lower bound on the average shortest path length in regular graphs

DOI10.1002/NET.3230040405zbMATH Open0317.90054OpenAlexW1963600265MaRDI QIDQ4079338FDOQ4079338

Authors: Vint Cerf, Ronald C. Mullin, R. G. Stanton, Donald D. Cowan 

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230040405

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cited In (4)

• Average distance and domination number
• The extremal average distance of cubic graphs
• Vertex-symmetric generalized Moore graphs.
• Communication structures in fault‐tolerant distributed systems

This page was built for publication: A lower bound on the average shortest path length in regular graphs

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