Maximal Intervals of Decrease and Inflection Points for Node Reliability

DOI10.1016/J.DAM.2022.02.002MaRDI QIDQ6363748arXivFDO

Authors Jason John Brown

Publication date 25 March 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2022.02.002

Mathematics Subject Classification ID

Graph polynomials (05C31) 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)

arXiv classification

math.COmath.PR

Abstract: The extit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each node operates independently with probability $pin[0,1]$. We show that unlike many other notions of graph reliability, the number of maximal intervals of decrease in $[0,1]$ is unbounded, and that there can be arbitrarily many inflection points in the interval as well.

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 Q6363748)