On the Rabin number problem

DOI10.1002/(SICI)1097-0037(199710)30:3%3C219::AID-NET6%3E3.0.CO;2-OMaRDI QIDQ4363414zbMATH OpenOpenAlexFDO

Authors Gen-Huey Chen, Dyi-Rong Duh

Publication date 6 November 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199710)30:3%3C219::aid-net6%3E3.0.co;2-o

zbMATH Keywords

circulant networksfault diametergeneralized hypercubesRabin numberwide diameterWK-recursive networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• The bound of Rabin number for connected undirected graph
• Strong Rabin numbers of folded hypercubes
• Rabin numbers of Butterfly networks
• Generalized diameters and Rabin numbers of networks

Cited in

(13)

• Short containers in Cayley graphs
• Generalized diameters and Rabin numbers of networks
• Rabin numbers of Butterfly networks
• Node-disjoint paths in hierarchical hypercube networks
• An efficient construction of one-to-many node-disjoint paths in folded hypercubes
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• Strong Rabin numbers of folded hypercubes
• The bound of Rabin number for connected undirected graph
• On strong Rabin numbers of graphs and digraphs
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• scientific article; zbMATH DE number 1944018 (Why is no real title available?)
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• Fault diameter of Cartesian product graphs

This page was built for publication: On the Rabin number problem

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