𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the order and size of s-geodetic digraphs with given connectivity

✍ Scribed by M.C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol

Book ID
108316106
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
468 KB
Volume
174
Category
Article
ISSN
0012-365X

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