## Abstract The odd girth of a graph __G__ is the length of a shortest odd cycle in __G__. Let __d__(__n, g__) denote the largest __k__ such that there exists a __k__‐regular graph of order __n__ and odd girth __g__. It is shown that __d____n, g__ ≥ 2|__n__/__g__≥ if __n__ ≥ 2__g__. As a consequenc
✦ LIBER ✦
The second eigenvalue of regular graphs of given girth
✍ Scribed by Patrick Solé
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 676 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The maximum valency of regular graphs wi
✍
Guo-Hui Zhang
📂
Article
📅
1992
🏛
John Wiley and Sons
🌐
English
⚖ 294 KB
👁 1 views
A lower bound on the order of regular gr
✍
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
The Size of Bipartite Graphs with a Give
✍
Shlomo Hoory
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 90 KB
The Girth of a Directed Distance-Regular
✍
D.A. Leonard; K. Nomura
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 149 KB
On eigenvalue multiplicity and the girth
✍
P. Rowlinson
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 256 KB
Extremal non-bipartite regular graphs of
✍
Zhao Dong-fang
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 95 KB