Name
Abstract | ||
|---|---|---|
Graph robustness-the ability of a graph to preserve its connectivity after the loss of nodes and edges-has been extensively studied to quantify how social, biological, physical, and technical systems withstand to external damages. In this paper, we prove that graph robustness can be quickly estimated through the Randic index, a parameter introduced in chemistry to study organic compounds. We prove... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCYB.2017.2763578 | IEEE Transactions on Cybernetics |
Keywords | Field | DocType |
Robustness,Indexes,Erbium,Eigenvalues and eigenfunctions,Graph theory,Laplace equations,Measurement | Graph theory,Graph,Discrete mathematics,Mathematical optimization,Robustness (computer science),Sampling (statistics),Degree distribution,Technical systems,Mathematics,Modular structure | Journal |
Volume | Issue | ISSN |
48 | 11 | 2168-2267 |
Citations | PageRank | References |
3 | 0.38 | 27 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pasquale De Meo | 1 | 741 | 48.91 |
| Fabrizio Messina | 2 | 363 | 37.95 |
| Domenico Rosaci | 3 | 779 | 55.81 |
| Giuseppe M. L. Sarnè | 4 | 518 | 37.32 |
| Athanasios V. Vasilakos | 5 | 12735 | 523.55 |