Connectivity and fault-tolerance of hyperdigraphs

DOI10.1016/S0166-218X(00)00333-4zbMath0995.05082WikidataQ127212135 ScholiaQ127212135MaRDI QIDQ1348372

Carles Padró, Daniela Ferrero

Publication date: 15 May 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

networksconnectivitydirected hypergraphsfault-diameter

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (2)

Partial line directed hypergraphs ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS

Cites Work

• Unnamed Item
• Directed hypergraphs and applications
• Diameter vulnerability of iterated line digraphs
• Bus interconnection networks
• Line Directed Hypergraphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• Connectivity of Imase and Itoh digraphs
• Design to Minimize Diameter on Building-Block Network
• Maximally connected digraphs
• De Bruijn and Kautz bus networks
• New bounds on the diameter vulnerability of iterated line digraphs

This page was built for publication: Connectivity and fault-tolerance of hyperdigraphs