Strong Rabin numbers of folded hypercubes
From MaRDI portal
Publication:2566009
DOI10.1016/j.tcs.2005.02.010zbMath1102.68096MaRDI QIDQ2566009
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.02.010
68R10: Graph theory (including graph drawing) in computer science
Related Items
One-to-many node-disjoint paths of hyper-star networks, \(\omega \)-wide diameters of enhanced pyramid networks, Two conditions for reducing the maximal length of node-disjoint paths in hypercubes, Fault-free cycles in folded hypercubes with more faulty elements, Some results on topological properties of folded hypercubes, Node-disjoint paths in hierarchical hypercube networks, On conditional diagnosability of the folded hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short containers in Cayley graphs
- Generalized diameters and Rabin numbers of networks
- Rabin numbers of Butterfly networks
- Wide diameters of butterfly networks
- From Hall's matching theorem to optimal routing on hypercubes
- On container length and wide-diameter in undirectional hypercubes
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Constructing one-to-many disjoint paths in folded hypercubes
- Fault tolerance properties of pyramid networks