Short containers in Cayley graphs
From MaRDI portal
Recommendations
Cites work
- 2-diameter of de Bruijn graphs
- A group-theoretic model for symmetric interconnection networks
- Combinatorial properties of generalized hypercube graphs
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fault tolerance of Cayley graphs
- From Hall's matching theorem to optimal routing on hypercubes
- Generalized degrees and Menger path systems
- Menger-type theorems with restrictions on path lengths
- Node-to-set disjoint paths problem in star graphs
- On Representatives of Subsets
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- On the fault-diameter of the star graph
- On the Rabin number problem
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The wide-diameter of then-dimensional toroidal mesh
- Topological properties of star graphs
Cited in
(5)- Node-disjoint paths in a level block of generalized hierarchical completely connected networks
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
- Strong Rabin numbers of folded hypercubes
- Resistance distances and the Kirchhoff index in Cayley graphs
- Application of width distance on semi-star link satellite constellation
This page was built for publication: Short containers in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028103)