Domination Reliability

Details Domination Reliability Domination Reliability

2011-03-20

arxiv.org/abs/1103.3854v1

Mathematics

Combinatorics

14 pages

Scientific 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 formulae 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.

Affiliated with

Also associated with

No associations

Rating

Domination Reliability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domination Reliability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domination Reliability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695751