Diameter 2 Cayley graphs of dihedral groups
From MaRDI portal
Abstract: We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree . We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically .
Recommendations
- Large Cayley graphs of small diameter
- Cayley graphs of diameter two and any degree with order half of the Moore bound
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree
- Cayley graphs of given degree and diameters 3, 4 and 5
Cites work
Cited in
(14)- Almost all Cayley graphs have diameter 2
- Asymptotically approaching the Moore bound for diameter three by Cayley graphs
- Large Cayley graphs of small diameter
- On diameter two Cayley graphs
- Cubic Cayley graphs with small diameter
- Reliability analysis of the Cayley graphs of dihedral groups
- Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree
- The structure of Cayley graphs of dihedral groups of valencies 1, 2 and 3
- Bound on the diameter of metacyclic groups
- Undirected loop networks
- On the diameter of the Cayley graph \(H_{\ell,p}\)
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- The structure of Cayley graph of dihedral groups of valency 4
- Measures of information spread in digraphs
This page was built for publication: Diameter 2 Cayley graphs of dihedral groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407036)