Recommendations
Cites work
- scientific article; zbMATH DE number 42739 (Why is no real title available?)
- scientific article; zbMATH DE number 1535250 (Why is no real title available?)
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fault diameter of interconnection networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Generalized diameters and Rabin numbers of networks
- On a Class of Multistage Interconnection Networks
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- Wide diameters of butterfly networks
Cited in
(6)- The bound of Rabin number for connected undirected graph
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Strong Rabin numbers of folded hypercubes
- w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
- Calculation of the accessibility number and the neighbor integrity of a graph
- Reliability measures in brother trees
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)