Complete rotations in Cayley graphs
From MaRDI portal
Recommendations
Cites work
- A family of Cayley graphs on the hexavalent grid
- A group-theoretic model for symmetric interconnection networks
- Connectivity of transitive graphs
- Graph multiplication
- scientific article; zbMATH DE number 3645098 (Why is no real title available?)
- scientific article; zbMATH DE number 3877215 (Why is no real title available?)
- scientific article; zbMATH DE number 3781457 (Why is no real title available?)
- scientific article; zbMATH DE number 3506978 (Why is no real title available?)
- scientific article; zbMATH DE number 1148256 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3379174 (Why is no real title available?)
- New gossips and telephones
- On a Class of Fixed-Point-Free Graphs
- On the action of non-Abelian groups on graphs
- Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
Cited in
(23)- A survey on Knödel graphs.
- Cyclotomic graphs and perfect codes
- Power domination in Knödel graphs and Hanoi graphs
- Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph
- Finding optimal routings in Hamming graphs
- The shortest path problem in the Knödel graph
- Cubic core-free symmetric \(m\)-Cayley graphs
- Cayley maps
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
- Rotational Cayley graphs on transposition generated groups
- Gossiping and routing in undirected triple-loop networks
- Edge-transitivity of Cayley graphs generated by transpositions
- Abelian Carter subgroups in finite permutation groups.
- Upper bounds on the broadcast function using minimum dominating sets
- Upper bounds for sorting permutations with a transposition tree
- Finite edge-transitive Cayley graphs and rotary Cayley maps
- 2-power domination number for Knödel graphs and its application in communication networks
- On broadcast schemes of Knödel graphs
- Pentavalent 2-regular core-free Cayley graphs
- On arrowhead and diamond diameters
- All sequential dimensional broadcast schemes in Knödel graphs
- Rotational circulant graphs
- On symmetries of Cayley graphs and the graphs underlying regular maps
This page was built for publication: Complete rotations in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927685)