scientific article; zbMATH DE number 3849260
[For the entire collection see Zbl 0517.00002.] For \(n\geq 3\), the n-cage is defined to be a smallest trivalent graph of girth n. The n-cages are known for various small values of n. [See \textit{W. T. Tutte}, Connectivity in graphs (1966; Zbl 0146.45603)]. Requiring the graphs under consideration to be (undirected) Cayley graphs, the author seeks so-called Cayley n-cages. For \(n=3,4\), and 6, the n-cages are Cayley graphs. While the 5-cage is the Petersen graph, he proves that the Cayley 5-cage must have exactly 50 vertices. For \(n=7,8,9\), Cayley n- cages are found with 30, 42, and 60 vertices, respectively. The Cayley 10-cage has \(\leq 100\) vertices. Theorem: Every trivalent Cayley graph of an affine group has girth \(\leq 14\). Subgroups of affine groups are used to show that the Cayley 13- and 14-cages have at most 272 and 406 vertices, respectively. Further special cases are considered.
- The 10-cages and derived configurations
- The correct diameter of trivalent Cayley graphs.
- On the density of trigraph homomorphisms
- A new family of trivalent Cayley networks on wreath product \(Z_{m}\wr S_{n}^\ast\)
- A trivalent graph of girth 17
- Properties of groups for the cage and degree/diameter problems
- Small vertex-transitive graphs of given degree and girth
- Recursive constructions of small regular graphs of given degree and girth
- On the limitations of the use of solvable groups in Cayley graph cage constructions
- On cycle lengths in claw-free graphs with complete closure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318798)