Graphs with maximum size and lower bounded girth
✍ Scribed by E. Abajo; A. Diánez
- Book ID
- 113449317
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 230 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, a lower bound on the maximum genus of a graph in terms of its girth is established as follows: let G be a simple graph with minimum degree at least three, and let g be the girth of G. Then ?M(G)~> ~fl(G) + 1 except for G=K4, g-1 where ]~(G) denotes the cycle rank of G and K4 is the co
## 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