w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
From MaRDI portal
Publication:3507647
DOI10.1002/net.20213zbMath1161.05328OpenAlexW4237148201MaRDI QIDQ3507647
Publication date: 20 June 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20213
hypercubeoptimization problemnode-disjoint pathsfolded hypercube\(w\)-Rabin numberstrong \(w\)-Rabin number
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Paths and cycles (05C38)
Related Items (8)
An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ A note on embeddings among folded hypercubes, even graphs and odd graphs ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ On \(g\)-extra connectivity of folded hypercubes ⋮ \(\omega \)-wide diameters of enhanced pyramid networks ⋮ Fault-free cycles in folded hypercubes with more faulty elements ⋮ Conditional matching preclusion sets ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Cites Work
This page was built for publication: w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
