Domination reliability
From MaRDI portal
Publication:426770
zbMath1243.05183arXiv1103.3854MaRDI QIDQ426770
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
hypergraph; reliability; decomposition; NP-hard; domination; inclusion-exclusion; cograph; broken circuit
05C31: Graph polynomials
05C65: Hypergraphs
90B15: Stochastic network models in operations research
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
On the roots of domination polynomial of graphs, On the domination polynomial of some graph operations, An abstraction of Whitney's broken circuit theorem, Inclusion-exclusion by ordering-free cancellation, Neighborhood and domination polynomials of graphs, Subset-sum representations of domination polynomials, Construction of dominating sets of certain graphs, Bipartition polynomials, the Ising model, and domination in graphs