๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton

Publisher
John Wiley and Sons
Year
1974
Tongue
English
Weight
226 KB
Volume
4
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower bound on the order of regular gr
A lower bound on the order of regular graphs with given girth pair
โœ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB ๐Ÿ‘ 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovรกcs [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209โ€“218]. A (ฮด, __g__)โ€cage is a small