Strong Rabin numbers of folded hypercubes

DOI10.1016/J.TCS.2005.02.010MaRDI QIDQ2566009zbMATH OpenOpenAlexFDO

Authors Cheng-Nan Lai, Gen-Huey Chen

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

zbMATH Keywords

Optimization problemNode-disjoint pathsFolded hypercubeStrong Rabin number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• The crossing number of folded hypercubes
• On strong Rabin numbers of graphs and digraphs
• scientific article; zbMATH DE number 1127885
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube
• A Ramsey-type result for the hypercube
• Total chromatic number of folded hypercubes.
• Cycles in folded hypercubes
• \( R_3\)-connectivity of folded hypercubes

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Constructing one-to-many disjoint paths in folded hypercubes
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Fault tolerance properties of pyramid networks
• From Hall's matching theorem to optimal routing on hypercubes
• Generalized diameters and Rabin numbers of networks
• Graph theory with applications
• On container length and wide-diameter in undirectional hypercubes
• On the Rabin number problem
• Rabin numbers of Butterfly networks
• Short containers in Cayley graphs
• Wide diameters of butterfly networks

Cited in

(10)

• -wide diameters of enhanced pyramid networks
• Fault-free cycles in folded hypercubes with more faulty elements
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• On conditional diagnosability of the folded hypercubes
• The bound of Rabin number for connected undirected graph
• One-to-many node-disjoint paths of hyper-star networks
• Node-disjoint paths in hierarchical hypercube networks
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• Some results on topological properties of folded hypercubes
• On strong Rabin numbers of graphs and digraphs

This page was built for publication: Strong Rabin numbers of folded hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566009)