𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the order of graphs with a given girth pair

✍ Scribed by Balbuena, C.; Salas, J.

Book ID
122000328
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
403 KB
Volume
321
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

Connectivity of graphs with given girth
Connectivity of graphs with given girth pair
✍ C. Balbuena; M. Cera; A. DiΓ‘nez; P. GarcΓ­a-VΓ‘zquez; X. Marcote πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 171 KB
The maximum valency of regular graphs wi
The maximum valency of regular graphs with given order and odd girth
✍ Guo-Hui Zhang πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 294 KB πŸ‘ 1 views

## 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