Determining the robustness of an interdependent network with a hypergraph model
The world is included of various entities and complex interdependencies between them that can be appeared in multi-layered networks. It may be the acting of some of these entities depends on the acting of the others such that the failure in one entity may cause failures in a number of others. In thi...
Saved in:
Main Authors: | , |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2020-04-01.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
LEADER | 01935 am a22002533u 4500 | ||
---|---|---|---|
001 | EJGTA_342_pdf_128 | ||
042 | |a dc | ||
100 | 1 | 0 | |a Shirdel, Gholam Hasan; Department of Mathematics, University of Qom, Qom, I. R. Iran |e author |
100 | 1 | 0 | |e contributor |
700 | 1 | 0 | |a Mortezaee, Ameneh; Department of Mathematics, University of Qom, Qom, I. R. Iran |e author |
245 | 0 | 0 | |a Determining the robustness of an interdependent network with a hypergraph model |
260 | |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, |c 2020-04-01. | ||
500 | |a https://www.ejgta.org/index.php/ejgta/article/view/342 | ||
520 | |a The world is included of various entities and complex interdependencies between them that can be appeared in multi-layered networks. It may be the acting of some of these entities depends on the acting of the others such that the failure in one entity may cause failures in a number of others. In this paper we try to model these complex interdependencies in a interdependent network with a directed hypergraph model and then we propose an algorithm to determine minimum number of failure for total failure in the power grid and communication network as a special interdependent network. | ||
540 | |a Copyright (c) 2020 Electronic Journal of Graph Theory and Applications (EJGTA) | ||
546 | |a eng | ||
690 | |a interdependent network, power grid and communication network, hypergraph, robustness | ||
655 | 7 | |a info:eu-repo/semantics/article |2 local | |
655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
655 | 7 | |a Peer-reviewed Article |2 local | |
786 | 0 | |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 8, No 1 (2020): Electronic Journal of Graph Theory and Applications; 113 - 122 | |
786 | 0 | |n 2338-2287 | |
787 | 0 | |n https://www.ejgta.org/index.php/ejgta/article/view/342/pdf_128 | |
856 | 4 | 1 | |u https://www.ejgta.org/index.php/ejgta/article/view/342/pdf_128 |z Get Fulltext |