𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The smallest graph of girth 6 and valency 7

✍ Scribed by M. O'Keefe; P. K. Wong

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

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

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

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

Reconstructing the number of copies of a
Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph
✍ A. J. H. King; C. St. J. A. Nash-Williams πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 489 KB πŸ‘ 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ξ¨; V(G) Ξ¨ V(H) such that __G__ ‐ ΞΎ β‰… H ‐ Ξ¨(ΞΎ) for every ΞΎ ∼ __V__(G). Let __J__ be a finite graph and /(Ο€) be a cardinal number for each Ο€ β‰… __V__(J). Suppose also that either /(Ο€) is infinite for every Ο€ β‰… __V__(J) or _

The smallest minimal blocking sets of Q(
The smallest minimal blocking sets of Q(6, q), q even
✍ J. De Beule; L. Storme πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 155 KB πŸ‘ 1 views

## Abstract We characterize the smallest minimal blocking sets of Q(6,__q__), __q__ even and __q__ β‰₯ 32. We obtain this result using projection arguments which translate the problem into problems concerning blocking sets of Q(4,__q__). Then using results on the size of the smallest minimal blocking