most citedConsecutive k-out-of-n:F Systems Have Unbounded Roots

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DM2022★ 2 cited

Consecutive k-out-of-n:F Systems Have Unbounded Roots

Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi +1

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are u…

math.CO2019

The shape of the reliability polynomial of a hammock network

Leonard Dăuş, Marilena Jianu

Motivated by the study of hammock (aka brick-wall) networks, we introduce in this paper the notion of X-path. Using the Jordan Curve Theorem for piecewise smooth curves, we prove d…