scientific article; zbMATH DE number 1769329

DOI10.1002/(SICI)1097-0037(199812)32:4%3C307::AID-NET7%3E3.0.CO;2-5MaRDI QIDQ4540085zbMATH OpenFDO

Authors Jung-Sing Jwo, Tai-Ching Tuan

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199812)32:4%3C307::AID-NET7%3E3.0.CO;2-5

zbMATH Keywords

unidirectional binary \(n\)-cubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On container length and wide-diameter in undirectional hypercubes
• New results in graph routing
• Longest fault-free paths in hypercubes with vertex faults
• How robust is the n-cube?
• scientific article; zbMATH DE number 1555951

Cited in

(12)

• Strong structural properties of unidirectional star graphs
• On container length and wide-diameter in undirectional hypercubes
• Node-disjoint paths in a level block of generalized hierarchical completely connected networks
• The 1-good neighbor connectivity of unidirectional star graph networks
• Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
• On the Day-Tripathi orientation of the star graphs: connectivity
• Oriented hypercubes
• scientific article; zbMATH DE number 2230273 (Why is no real title available?)
• Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network
• Characterization of minimum restricted arc-cuts of unidirectional hypercubes
• The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model
• Orienting Cayley graphs generated by transposition trees

This page was built for publication:

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