## 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
A note on minimum graphs with girth pair (4, 2l + 1)
✍ Scribed by Denis Hanson; Ping Wang; Gary Macgillivray
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 125 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We show that the size of a smallest connected k‐regular graph with girth pair (4, 2__l__ + 1) is within a constant of (2__l__ + 1) k/2. In so doing we disprove a conjecture of Harary and Kovacs.
📜 SIMILAR VOLUMES
## Abstract Unusual course of the reaction was revealed on the oxidation of functionally substituted acridine containing the activated methyl groups by well‐known oxidants, such as selenous acid and selenium(IV) oxide. Treatment of 2‐methoxy‐4,9‐dimethyl‐1‐nitroacridine (**5**) with an excess of H~
The kinetics of the rearrangement of 3,4-di-O-benzyl-l,Z-n-(1-methoxyethylid~ne)-~-L-rhamnopy~~nose to methyl 2-O-acetyl-3.4-di-O-bcnzyl-tu-L-rhamnopyranoside with a catalytic amount of 1 ,I .3,3,-tctralnethylurea-trifluoromethanesulfonic acid in deuterated chloroform was studied by 'H-n.m.r. spectr