Some larger trivalent graphs having small diameters

Some larger trivalent graphs having small diameters

0.00 Avg rating0 Votes
Article ID: iaor1993642
Country: Netherlands
Volume: 37/38
Issue: 1/5
Start Page Number: 353
End Page Number: 357
Publication Date: Jul 1992
Journal: Discrete Applied Mathematics
Authors:
Abstract:

This paper concerns an improvement of a result of Babai, Kantor and Lubotzky. It was shown that there is a constant C such that every non-Abelian finite simple group G has a set S of seven generators for which equ1. Here, S was a carefully chosen generating set for G, and equ2denotes the diameter of the corresponding undirected Cayley graph. This bound is best possible, since a simple count (the ‘Moore bound’) shows that equ3.

Reviews

Required fields are marked *. Your email address will not be published.