Maximal intervals of decrease and inflection points for node reliability
DOI10.1016/J.DAM.2022.02.002zbMATH Open1485.90028OpenAlexW3138117670MaRDI QIDQ832992FDOQ832992
Authors: N. E. Zubov
Publication date: 28 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.002
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Graph polynomials (05C31)
Cites Work
- The Complexity of the Residual Node Connectedness Reliability Problem
- Computing residual connectedness reliability for restricted networks
- Uniformly optimal graphs in some classes of graphs with node failures
- The shape of node reliability
- On reliability of graphs with node failures
- Reliability polynomials having arbitrarily many inflection points
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Maximal intervals of decrease and inflection points for node reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832992)