Reliability measures in brother trees

DOI10.1142/S1793830923500283MaRDI QIDQ6560777zbMATH OpenFDO

Authors Remi Mariam Reji, R. Sundara Rajan

Publication date 24 June 2024

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923500283

zbMATH Keywords

brother treeconnectivityfault diameterRabin numberwide diameter

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4081269
• Rabin numbers of Butterfly networks
• scientific article; zbMATH DE number 828049
• Large fault-tolerant interconnection networks
• Network reliability

Cites work

• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Fault diameter of interconnection networks
• Fault tolerance properties of pyramid networks
• Generalized diameters and Rabin numbers of networks
• scientific article; zbMATH DE number 6096694 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Rabin numbers of Butterfly networks
• Ring embedding in faulty honeycomb rectangular torus.
• The diameter variability of the Cartesian product of graphs
• The fault-diameter and wide-diameter of twisted hypercubes
• Wide diameter of generalized Petersen graphs
• Wide diameters of butterfly networks
• Wide diameters of Cartesian product graphs and digraphs

This page was built for publication: Reliability measures in brother trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560777)