On the node reliability of Harary graphs: an analysis through real-world topologies
preprintposted on 24.11.2021, 11:50 by Leonardo de LimaLeonardo de Lima
The literature on network reliability shows that Harary networks are designed so that the link reliability is maximum in many cases. The following question: ``what are the best topology networks in maximizing node reliability?'' is still open. In this paper, we performed computational experiments with eleven real-world networks and their corresponding Harary graphs. The node reliability of both sets of networks was computed. Computational results point out that the Harary network has a topology with high node reliability if compared to the real-world networks studied.