𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a graph of O'Keefe and wong

✍ Scribed by T. Ito

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
310 KB
Volume
5
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The graph of O'Keefe and Wong, with valency 7, girth 6, and 90 vertices, is constructed as a 3‐fold covering graph, and it is shown that there is a unique covering graph with these properties.

πŸ“œ SIMILAR VOLUMES

The smallest graph of girth 6 and valenc
The smallest graph of girth 6 and valency 7
✍ M. O'Keefe; P. K. Wong πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 258 KB

## Abstract With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.

A Note on Graph Colorings and Graph Poly
A Note on Graph Colorings and Graph Polynomials
✍ Noga Alon; Michael Tarsi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 491 KB πŸ‘ 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

A theorem of Sibony and Wong
A theorem of Sibony and Wong
✍ S. Yu. Favorov πŸ“‚ Article πŸ“… 1990 πŸ› Springer US 🌐 English βš– 381 KB