Rabin numbers of Butterfly networks
From MaRDI portal
Publication:1297411
DOI10.1016/S0012-365X(98)00175-7zbMATH Open0931.68084OpenAlexW1996377170WikidataQ128131956 ScholiaQ128131956MaRDI QIDQ1297411FDOQ1297411
Authors: Sheng-Chyang Liaw, Gerard Jennhwa Chang
Publication date: 9 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00175-7
Recommendations
Cites Work
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fault diameter of interconnection networks
- Generalized diameters and Rabin numbers of networks
- Title not available (Why is that?)
- On a Class of Multistage Interconnection Networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- Wide diameters of butterfly networks
- Title not available (Why is that?)
Cited In (6)
- Reliability measures in brother trees
- w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
- The bound of Rabin number for connected undirected graph
- Calculation of the accessibility number and the neighbor integrity of a graph
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Strong Rabin numbers of folded hypercubes
This page was built for publication: Rabin numbers of Butterfly networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297411)