𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strongly regular graphs with smallest eigenvalue —m

✍ Scribed by A. Neumaier

Book ID
112499087
Publisher
Springer
Year
1979
Tongue
English
Weight
408 KB
Volume
33
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Smallest regular graphs with prescribed
Smallest regular graphs with prescribed odd girth
✍ Guo-Hui Zhang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB 👁 1 views

## Abstract The odd girth of a graph __G__ gives the length of a shortest odd cycle in __G.__ Let __f(k,g)__ denote the smallest __n__ such that there exists a __k__‐regular graph of order __n__ and odd girth __g.__ The exact values of __f(k,g)__ are determined if one of the following holds: __k__