𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The uniqueness of the strongly regular graph on 77 points

✍ Scribed by A. E. Brouwer

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
329 KB
Volume
7
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Circumferences of Regular 2-Conne
On the Circumferences of Regular 2-Connected Graphs
✍ Bing Wei πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 135 KB

Let G be a 2-connected d-regular graph on n rd (r 3) vertices and c(G) denote the circumference of G. Bondy conjectured that c(G) 2nΓ‚(r&1) if n is large enough. In this paper, we show that c(G) 2nΓ‚(r&1)+2(r&3)Γ‚(r&1) for any integer r 3. In particular, G is hamiltonian if r=3. This generalizes a resu

On the chromatic number of a random 5-re
On the chromatic number of a random 5-regular graph
✍ J. DΓ­az; A. C. Kaporis; G. D. Kemkes; L. M. Kirousis; X. PΓ©rez; N. Wormald πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 275 KB πŸ‘ 1 views

## Abstract It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is as

On the uniqueness of the smallest graph
On the uniqueness of the smallest graph of girth 5 and valency 6
✍ Pak-Ken Wong πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 96 KB πŸ‘ 1 views

Let G be a regular graph of girth n( 2 5 ) and valency k ( r 3 ) , that has the least possible number f(k, n ) of vertices. Although the existence of such a graph was proved by Erdos and Sachs (see Ref. 6, p. 82), only a few cases have been solved (see Refs. 2-7). Recently, O'Keefe and Wong have sho