𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular Graphs with Given Girth and Restricted Circuits

✍ Scribed by Sachs, H.

Book ID
120098195
Publisher
Oxford University Press
Year
1963
Tongue
English
Weight
216 KB
Volume
s1-38
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Regular graphs with given girth pair
Regular graphs with given girth pair
✍ Frank Harary; Peter KovΓ‘cs πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 453 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 is proved and simple bounds for their smallest order are developed. Several infinite classes of such graphs are constructed and it is

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