Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes

DOI10.1007/s11766-998-0039-xzbMath0911.05032OpenAlexW2312959533MaRDI QIDQ1129812

Jun-Ming Xu

Publication date: 8 November 1998

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0039-x

zbMATH Keywords

hypercubedigraphsfault-tolerant networksfault-tolerant routings

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (8)

Fault diameter of Cartesian product graphs ⋮ Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Arc fault tolerance of cartesian product digraphs on hyper arc connectivity ⋮ On cyclic vertex-connectivity of Cartesian product digraphs ⋮ Reliability of interconnection networks modeled by Cartesian product digraphs ⋮ Super-connected and super-arc-connected Cartesian product of digraphs ⋮ Super restricted edge connected Cartesian product graphs ⋮ Connectivity of Cartesian product graphs

Cites Work

• Unnamed Item
• Fault-tolerant routings in Kautz and de Bruijn networks
• Graphs with Given Group and Given Graph-Theoretical Properties

This page was built for publication: Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes