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: | Shirdel, Gholam Hasan; Department of Mathematics, University of Qom, Qom, I. R. Iran (Author), Mortezaee, Ameneh; Department of Mathematics, University of Qom, Qom, I. R. Iran (Author) |
---|---|
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!
|
Similar Items
-
On maximum signless Laplacian Estrada index of graphs with given parameters II
by: Nasiri, Ramin; Department of Mathematics, Faculty of Science, University of Qom, Qom 7161-46611, I. R. Iran, et al.
Published: (2018) -
Noise-robust classification with hypergraph neural network
by: Vu Dang, Nguyen Trinh, et al.
Published: (2021) -
Anti-Ramsey Hypergraph Numbers
by: Budden, Mark; Department of Mathematics and Computer Science, Western Carolina University, Cullowhee, NC 28723, USA, et al.
Published: (2021) -
Problems on chromatic polynomials of hypergraphs
by: Zhang, Ruixue; Mathematics and Mathematics Education National Institute of Education Nanyang Technological University, Singapore 637616, et al.
Published: (2020) -
On the signed $2$-independence number of graphs
by: Moghaddam, S.M. Hosseini; Qom Azad University, Qom, Iran, et al.
Published: (2017)