𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive constructions of small regular graphs of given degree and girth

✍ Scribed by Exoo, Geoffrey (author);Jajcay, Robert (author)

Book ID
113567491
Publisher
Elsevier B.V.
Year
2012
Tongue
English
Weight
295 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Families of small regular graphs of girt
Families of small regular graphs of girth 5
✍ M. Abreu; G. Araujo-Pardo; C. Balbuena; D. Labbate πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 328 KB
Small vertex-transitive and Cayley graph
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
✍ Eyal Loz; Martin Mačaj; Mirka Miller; Jana Ε iagiovΓ‘; Jozef Ε irÑň; Jana TomanovΓ‘ πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

We examine the existing constructions of the smallest known vertex-transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of

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