Asymptotically approaching the Moore bound for diameter three by Cayley graphs
From MaRDI portal
Publication:1633751
Abstract: The largest order of a graph of maximum degree and diameter cannot exceed the Moore bound, which has the form for and any fixed . Known results in finite geometries on generalised -gons imply, for , the existence of an infinite sequence of values of such that . This shows that for the Moore bound can be asymptotically approached in the sense that as ; moreover, no such result is known for any other value of . The corresponding graphs are, however, far from vertex-transitive, and there appears to be no obvious way to extend them to vertex-transitive graphs giving the same type of asymptotic result. The second and the third author (2012) proved by a direct construction that the Moore bound for diameter can be asymptotically approached by Cayley graphs. Subsequently, the first and the third author (2015) showed that the same construction can be derived from generalised triangles with polarity. By a detailed analysis of regular orbits of suitable groups of automorphisms of graphs arising from polarity quotients of incidence graphs of generalised quadrangles with polarity, we prove that for an infinite set of values of there exist Cayley graphs of degree , diameter , and order . The Moore bound for diameter can thus as well be asymptotically approached by Cayley graphs. We also show that this method does not extend to constructing Cayley graphs of diameter from generalised hexagons with polarity.
Recommendations
- Approaching the Moore bound for diameter two by Cayley graphs
- Cayley graphs of diameter two and any degree with order half of the Moore bound
- Large Cayley graphs of small diameter
- Cayley graphs of given degree and diameters 3, 4 and 5
- Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
Cites work
- scientific article; zbMATH DE number 5309966 (Why is no real title available?)
- scientific article; zbMATH DE number 1219619 (Why is no real title available?)
- scientific article; zbMATH DE number 3794103 (Why is no real title available?)
- scientific article; zbMATH DE number 3432305 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- Approaching the Moore bound for diameter two by Cayley graphs
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- Cayley graphs of given degree and diameters 3, 4 and 5
- Cycle prefix digraphs for symmetric interconnection networks
- Diameter 2 Cayley graphs of dihedral groups
- Examples of products giving large graphs with given degree and diameter
- Finite generalized quadrangles
- Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
- On Moore Graphs with Diameters 2 and 3
- On a Class of Fixed-Point-Free Graphs
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Ovoides et groupes de Suzuki
- Polarity graphs revisited
- Structure of Ree groups
- Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
- The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
Cited in
(2)
This page was built for publication: Asymptotically approaching the Moore bound for diameter three by Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633751)