Reliability measures in brother trees
From MaRDI portal
Publication:6560777
DOI10.1142/s1793830923500283MaRDI QIDQ6560777
R. Sundara Rajan, Remi Mariam Reji
Publication date: 24 June 2024
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Christmas tree: a versatile 1-fault-tolerant design for token rings
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
- Fault diameter of interconnection networks
- Generalized diameters and Rabin numbers of networks
- Rabin numbers of Butterfly networks
- Wide diameters of butterfly networks
- The fault-diameter and wide-diameter of twisted hypercubes
- Wide diameters of Cartesian product graphs and digraphs
- Ring embedding in faulty honeycomb rectangular torus.
- w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
- Fault tolerance properties of pyramid networks
- THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS
This page was built for publication: Reliability measures in brother trees
