Pages that link to "Item:Q5927685"
From MaRDI portal
The following pages link to Complete rotations in Cayley graphs (Q5927685):
Displaying 20 items.
- Edge-transitivity of Cayley graphs generated by transpositions (Q339495) (← links)
- Abelian Carter subgroups in finite permutation groups. (Q382264) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- Rotational circulant graphs (Q741752) (← links)
- On symmetries of Cayley graphs and the graphs underlying regular maps (Q834823) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- Cyclotomic graphs and perfect codes (Q1621577) (← links)
- Power domination in Knödel graphs and Hanoi graphs (Q1692626) (← links)
- Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph (Q1827675) (← links)
- Finding optimal routings in Hamming graphs (Q1864615) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← links)
- Cubic core-free symmetric \(m\)-Cayley graphs (Q2338624) (← links)
- Cayley maps (Q2573643) (← links)
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes (Q2637237) (← links)
- Rotational Cayley graphs on transposition generated groups (Q2816104) (← links)
- Gossiping and routing in undirected triple-loop networks (Q3057157) (← links)
- UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334) (← links)
- Finite edge-transitive Cayley graphs and rotary Cayley maps (Q5473453) (← links)
- 2-power domination number for Knödel graphs and its application in communication networks (Q6181254) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
