Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/networks/CerfCMS74
%A Cerf, Vinton G.
%A Cowan, Donald D.
%A Mullin, Ronald C.
%A Stanton, R. G.
%D 1974
%J Networks
%K dblp
%N 4
%P 335-342
%T A lower bound on the average shortest path length in regular graphs.
%U http://dblp.uni-trier.de/db/journals/networks/networks4.html#CerfCMS74
%V 4
@article{journals/networks/CerfCMS74,
added-at = {2023-10-02T00:00:00.000+0200},
author = {Cerf, Vinton G. and Cowan, Donald D. and Mullin, Ronald C. and Stanton, R. G.},
biburl = {https://www.bibsonomy.org/bibtex/26ee199f5432e1375220e44138c8e0128/dblp},
ee = {https://doi.org/10.1002/net.3230040405},
interhash = {cad7bb8ceddab967c67b73d554cc443c},
intrahash = {6ee199f5432e1375220e44138c8e0128},
journal = {Networks},
keywords = {dblp},
number = 4,
pages = {335-342},
timestamp = {2024-04-09T05:40:36.000+0200},
title = {A lower bound on the average shortest path length in regular graphs.},
url = {http://dblp.uni-trier.de/db/journals/networks/networks4.html#CerfCMS74},
volume = 4,
year = 1974
}