On the Rabin number problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-O" /><219::AID-NET6>3.0.CO;2-O 10.1002/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-OzbMath0893.90163OpenAlexW2010509012MaRDI QIDQ4363414

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<219::aid-net6>3.0.co;2-o

zbMATH Keywords

fault diameterwide diametercirculant networksRabin numberWK-recursive networksgeneralized hypercubes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Fault diameter of Cartesian product graphs ⋮ 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 ⋮ Short containers in Cayley graphs ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Strong Rabin numbers of folded hypercubes

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