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

DOI10.1002/net.3230040405zbMath0317.90054OpenAlexW1963600265MaRDI QIDQ4079338

Ralph G.Stanton, Ronald C. Mullin, Vint Cerf, 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)

Related Items (4)

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

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