scientific article; zbMATH DE number 1769329

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

Authors: Jung-Sing Jwo, Tai-Ching Tuan 

Publication date: 21 July 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

unidirectional binary \(n\)-cubes

Mathematics Subject Classification ID

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

Cited In (10)

• The 1-good neighbor connectivity of unidirectional star graph networks
• On container length and wide-diameter in undirectional hypercubes
• Orienting Cayley graphs generated by transposition trees
• Strong structural properties of unidirectional star graphs
• On the Day-Tripathi orientation of the star graphs: connectivity
• Title not available (Why is that?)
• Node-disjoint paths in a level block of generalized hierarchical completely connected networks
• Relating \(g\)-good-neighbor connectivity and \(g\)-good-neighbor diagnosability of strong digraph network
• Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
• Oriented hypercubes

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)