Reliabilities for two kinds of graphs with smaller diameters

Yihong Wang, Jixiang Meng and Jianxi Fan

Applied Mathematics and Computation, 2023, vol. 446, issue C

Abstract: Two crucial parameters to be considered when evaluating a network’s reliability are its connectivity and diagnosability. The connectivity of a graph is defined as the smallest number of vertices that, if removed, would leave a disconnected or single-vertex graph. The diagnosability is the maximum number of faulty vertices that the system can correctly identify. In this paper, aim to obtain the reliability of various graphs (e.g. interconnection networks and data center networks), we propose two kinds of graphs (resp. networks)—matching recursive graphs (MRGs) and recursive networks based on connected graphs (RNCGs). We prove that these two kinds of graphs have smaller diameters. Furthermore, we study their reliabilities, including connectivities and diagnosabilities. Moreover, we also extend our results to many graphs.

Keywords: Reliability; MRG; RNCG; Hypercube; DCell (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323000437
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:446:y:2023:i:c:s0096300323000437

DOI: 10.1016/j.amc.2023.127874

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().