Domination reliability

zbMath1243.05183arXiv1103.3854MaRDI QIDQ426770

Peter Tittmann, Klaus Dohmen

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.3854

zbMATH Keywords

hypergraphreliabilitydecompositionNP-harddominationinclusion-exclusioncographbroken circuit

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Stochastic network models in operations research (90B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (12)

On the roots of domination polynomial of graphs ⋮ The average domination polynomial of graphs is unimodal ⋮ Inclusion-exclusion by ordering-free cancellation ⋮ Graph operations and neighborhood polynomials ⋮ On the domination polynomial of some graph operations ⋮ More on the unimodality of domination polynomial of a graph ⋮ An abstraction of Whitney's broken circuit theorem ⋮ Optimal domination polynomials ⋮ Construction of dominating sets of certain graphs ⋮ Neighborhood and domination polynomials of graphs ⋮ Subset-sum representations of domination polynomials ⋮ Bipartition polynomials, the Ising model, and domination in graphs

This page was built for publication: Domination reliability