Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On the node reliability of Harary graphs: an analysis through real-world topologies

View through CrossRef
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.
Institute of Electrical and Electronics Engineers (IEEE)
Title: On the node reliability of Harary graphs: an analysis through real-world topologies
Description:
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.

Related Results

Harary spectra and Harary energy of line graphs of regular graphs
Harary spectra and Harary energy of line graphs of regular graphs
The Harary matrix of a graph G is defined as RD(G) = [rij] in which rij = 1 ∕ dij if i ≠ j and rij = 0 if i = j, where dij is the distance between the vertices vi and vj in G. The ...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Tightness of Harary Graphs
Tightness of Harary Graphs
In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tig...
Predictors of False-Negative Axillary FNA Among Breast Cancer Patients: A Cross-Sectional Study
Predictors of False-Negative Axillary FNA Among Breast Cancer Patients: A Cross-Sectional Study
Abstract Introduction Fine-needle aspiration (FNA) is commonly used to investigate lymphadenopathy of suspected metastatic origin. The current study aims to find the association be...
A framework for hierarchical compound topologies in species interaction networks
A framework for hierarchical compound topologies in species interaction networks
Hierarchical compound topologies of interaction networks that are segmented into internally nested modules have received scant attention, compared to simple nested and modular topo...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Differentiating the lymph node metastasis of breast cancer through dynamic contrast-enhanced magnetic resonance imaging
Differentiating the lymph node metastasis of breast cancer through dynamic contrast-enhanced magnetic resonance imaging
Objective: Lymph node metastasis is an important trait of breast cancer, and tumors with different lymph node statuses require various clinical treatments. This study was designed ...

Back to Top