scientific article; zbMATH DE number 1444280
From MaRDI portal
Publication:4953320
Recommendations
Cited in
(33)- Uniformly optimal graphs in some classes of graphs with node failures
- Sixty years of network reliability
- The shape of node reliability
- Invulnerability of planar two-tree networks
- Graphs with most number of three point induced connected subgraphs
- On locally most reliable three-terminal graphs of sparse graphs
- Network reliability in Hamiltonian graphs
- On component order edge reliability and uniform optimality
- On uniformly most reliable complete multi-partite graphs
- A class of uniformly optimality complete multi-partite graphs
- Uniformly least reliable graphs in class (n,e) as e n+1.
- scientific article; zbMATH DE number 434697 (Why is no real title available?)
- scientific article; zbMATH DE number 4081269 (Why is no real title available?)
- scientific article; zbMATH DE number 4102998 (Why is no real title available?)
- A reliability-improving graph transformation with applications to network reliability
- scientific article; zbMATH DE number 139921 (Why is no real title available?)
- scientific article; zbMATH DE number 140110 (Why is no real title available?)
- The average reliability of a graph
- On reliability of graphs with node failures
- Uniformly optimally reliable graphs
- On the mean connected induced subgraph order of cographs
- scientific article; zbMATH DE number 2140713 (Why is no real title available?)
- scientific article; zbMATH DE number 867686 (Why is no real title available?)
- A research on related properties of hybrid benzenoid system
- On the probability of facing random breakdowns: a measure of networks' vulnerability
- The node cop‐win reliability of unicyclic and bicyclic graphs
- Uniformly optimally reliable graphs: A survey
- Network reliability: Heading out on the highway
- <scp>M</scp>ost reliable two‐terminal graphs with node failures
- On the split reliability of graphs
- Wagner and Petersen are uniformly most-reliable graphs
- Uniformly most reliable three-terminal graph of dense graphs
- Maximal intervals of decrease and inflection points for node reliability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953320)