Short containers in Cayley graphs

DOI10.1016/J.DAM.2008.11.005zbMath1204.05052OpenAlexW2089163952MaRDI QIDQ1028103

D. Frank Hsu, Shuhong Gao

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.005

zbMATH Keywords

groupsCayley graphshypercubesdisjoint pathsdisjoint orderingstar diametersstar distances

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items (5)

Application of width distance on semi–star link satellite constellation ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Resistance distances and the Kirchhoff index in Cayley graphs ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Strong Rabin numbers of folded hypercubes

Cites Work

• Node-to-set disjoint paths problem in star graphs
• Menger-type theorems with restrictions on path lengths
• Generalized degrees and Menger path systems
• On the fault-diameter of the star graph
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Combinatorial properties of generalized hypercube graphs
• From Hall's matching theorem to optimal routing on hypercubes
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Topological properties of star graphs
• Fault tolerance of Cayley graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• A group-theoretic model for symmetric interconnection networks
• On the Rabin number problem
• On Representatives of Subsets
• The wide-diameter of then-dimensional toroidal mesh
• 2-diameter of de Bruijn graphs

This page was built for publication: Short containers in Cayley graphs