On reliability of graphs with node failures
From MaRDI portal
Recommendations
Cited in
(25)- Network reliability in Hamiltonian graphs
- Maximal intervals of decrease and inflection points for node reliability
- Uniformly least reliable graphs in class (n,e) as e n+1.
- The average reliability of a graph
- Invulnerability of planar two-tree networks
- scientific article; zbMATH DE number 913349 (Why is no real title available?)
- Uniformly optimal graphs in some classes of graphs with node failures
- On the probability of facing random breakdowns: a measure of networks' vulnerability
- Sixty years of network reliability
- Sparse reliable graph backbones
- Uncoverings on graphs and network reliability
- The shape of node reliability
- On locally most reliable three-terminal graphs of sparse graphs
- scientific article; zbMATH DE number 139921 (Why is no real title available?)
- scientific article; zbMATH DE number 4095184 (Why is no real title available?)
- On the mean connected induced subgraph order of cographs
- scientific article; zbMATH DE number 2140713 (Why is no real title available?)
- Sparse reliable graph backbones
- Reliability analysis of godan graphs
- <scp>M</scp>ost reliable two‐terminal graphs with node failures
- Uniformly optimally reliable graphs: A survey
- The node cop‐win reliability of unicyclic and bicyclic graphs
- Node partition formula for directed graph reliability
- Network reliability: Heading out on the highway
- Computing the \(K\)-terminal reliability of directed path graphs
This page was built for publication: On reliability of graphs with node failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4303630)
