A Characterization of Hypergraphs with Large Domination Number
Let H = (V, E) be a hypergraph with vertex set V and edge set E. A dominating set in H is a subset of vertices D ⊆ V such that for every vertex v ∈ V \ D there exists an edge e ∈ E for which v ∈ e and e ∩ D ≠ ∅. The domination number γ(H) is the minimum cardinality of a dominating set in H. It is kn...
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
University of Zielona Góra
2016-05-01
|
| Ráidu: | Discussiones Mathematicae Graph Theory |
| Fáttát: | |
| Liŋkkat: | https://doi.org/10.7151/dmgt.1865 |