A variety of probabilistic notions of network reliability of graphs and digraphs have been
proposed and studied since the early 1950s. Although grounded in the engineering and …

The study of network reliability started in 1956 with a groundbreaking paper by EF Moore
and CE Shannon. They introduced a probabilistic model of network reliability, where the …

This article studies the roots of the reliability polynomials of linear consecutive‐k‐out‐of‐n: F
systems. We prove that these roots are unbounded in the complex plane, for any fixed k≥ 2 …

In this article the extremal structures for the mean order of connected induced subgraphs of
cographs are determined. It is shown that among all connected cographs of order $ n\ge 7 …

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 unbounded in …

Telecommunication networks are vulnerable towards single or simultaneous nodes/links
failures, which may lead to the disruption of network areas. The failures may cause …

For a tree T, the subtree polynomial of T is the generating polynomial for the number of
subtrees of T. We show that the complex roots of the subtree polynomial are contained in the …

Edge reliability problem has many applications in different field of science and engineering
such as: cognitive science, neuroscience, electrical engineering, network science and so on …

Various models to quantify the reliability of a network have been studied where certain
components of the graph may fail at random and the probability that the remaining graph is …