Constructing one-to-many disjoint paths in folded hypercubes

DOI10.1109/12.980015zbMath1392.68328OpenAlexW2084476524MaRDI QIDQ4571312

Gen-Huey Chen, Cheng-Nan Lai, Dyi-Rong Duh

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.980015

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Strong Menger connectivity with conditional faults of folded hypercubes ⋮ On reliability of the folded hypercubes ⋮ Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ Conditional connectivity of folded hypercubes ⋮ On conditional diagnosability of the folded hypercubes ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Cycles in folded hypercubes ⋮ \(\omega \)-wide diameters of enhanced pyramid networks ⋮ Fault-free cycles in folded hypercubes with more faulty elements ⋮ Some results on topological properties of folded hypercubes ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ The spanning connectivity of folded hypercubes ⋮ On reliability of the folded hypercubes in terms of the extra edge-connectivity ⋮ Extraconnectivity of hypercubes ⋮ Strong Rabin numbers of folded hypercubes

This page was built for publication: Constructing one-to-many disjoint paths in folded hypercubes