Domination Reliability
Copyright policy )Domination Reliability
In this paper, we propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph. We derive explicit and recursive formulæ for domination reliability and its associated domination reliability polynomial, deduce an analogue of Whitney's broken circuit theorem, and prove that computing domination reliability is NP-hard.
- Hochschule Mittweida Germany
FOS: Computer and information sciences, reliability, decomposition, Discrete Mathematics (cs.DM), Discrete Mathematics, broken circuit, Probability (math.PR), hypergraph, 05C30, 05C31 (Primary) 62N05, 68M15, 90B25 (Secondary), NP-hard, Hypergraphs, Reliability, testing and fault tolerance of networks and computer systems, Stochastic network models in operations research, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph polynomials, Combinatorics, FOS: Mathematics, inclusion-exclusion, Combinatorics (math.CO), cograph, domination, Probability
FOS: Computer and information sciences, reliability, decomposition, Discrete Mathematics (cs.DM), Discrete Mathematics, broken circuit, Probability (math.PR), hypergraph, 05C30, 05C31 (Primary) 62N05, 68M15, 90B25 (Secondary), NP-hard, Hypergraphs, Reliability, testing and fault tolerance of networks and computer systems, Stochastic network models in operations research, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph polynomials, Combinatorics, FOS: Mathematics, inclusion-exclusion, Combinatorics (math.CO), cograph, domination, Probability
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!