Multiple Domination
From MaRDI portal
Publication:3384609
DOI10.1007/978-3-030-51117-3_6zbMath1479.05267MaRDI QIDQ3384609
Adriana Hansberg, Lutz Volkmann
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_6
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
A note on the k-tuple domination number of graphs, Relating the super domination and 2-domination numbers in cactus graphs, Graphs with unique minimum specified domination sets, Double domination in rooted product graphs, New bounds on the double total domination number of graphs
Cites Work
- Invariants concerning \(f\)-domination in graphs
- New results on \(k\)-independence of graphs
- Bounds on the connected \(k\)-domination number in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- \(k\)-tuple total domination in graphs
- Onk-tuple domination of random graphs
- On domination and independent domination numbers of a graph
- A note on the k-domination number of a graph
- The upper bound on \(k\)-tuple domination numbers of graphs
- Ratios of some domination parameters in trees
- Total domination of graphs and small transversals of hypergraphs
- The \(k\)-tuple domination number revisited
- Proof of a conjecture on \(k\)-tuple domination in graphs
- Grundy number and products of graphs
- \(k\)-tuple domination in graphs
- Total domination in graphs with given girth
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- On graphs having domination number half their order
- On the ratio of optimal integral and fractional covers
- On graphs with equal domination and covering numbers
- A note on Nordhaus-Gaddum inequalities for domination.
- An inequality related to Vizing's conjecture
- Upper bounds for \(f\)-domination number of graphs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- On the total \(k\)-domination in graphs
- Total \(k\)-domination in Cartesian product graphs
- Bounds on the 2-domination number
- Upper \(k\)-tuple total domination in graphs
- On the total domination number of Cartesian products of graphs
- Transversal numbers of uniform hypergraphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- \(H\)-forming sets in graphs
- Sunflower hypergraphs are chromatically unique
- Nordhaus-Gaddum inequalities for domination in graphs
- \(k\)-tuple total domination in cross products of graphs
- The multiple domination and limited packing problems in graphs
- On the approximability and exact algorithms for vector domination and related problems in graphs
- New approach to the \(k\)-independence number of a graph
- Paired versus double domination in \(K_{1,r}\)-free graphs
- Bipartite graphs with close domination and \(k\)-domination numbers
- Critical concepts in domination
- Graphs with equal domination and covering numbers
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- On general frameworks and threshold functions for multiple domination
- On some extremal problems in graph theory
- On upper bounds for multiple domination numbers of graphs
- On \(k\)-domination and \(j\)-independence in graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- Restricted domination parameters in graphs
- A generalised upper bound for the \(k\)-tuple domination number
- On graphs with equal domination and 2-domination numbers
- Independent sets in triangle-free cubic planar graphs
- Some bounds on the \(p\)-domination number in trees
- Characterizations of trees with equal paired and double domination numbers
- Minimum 2-tuple dominating set of permutation graphs
- Dominating a Family of Graphs with Small Connected Subgraphs
- New Bounds on the Grundy Number of Products of Graphs
- Independence andk-domination in graphs
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- A general method in the theory of domination in graphs
- The k-domatic number of a graph
- A bound on the k-domination number of a graph
- Vizing's conjecture: a survey and recent results
- Intersection Theorems for Systems of Sets
- [https://portal.mardi4nfdi.de/wiki/Publication:3303523 Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs]
- 3-Tuple domination number in complete grid graphs
- Double Domination in the Cartesian and Tensor Products of Graphs
- Onk-domination and minimum degree in graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Bounds for the 2-domination number of toroidal grid graphs
- An upper bound for thek-domination number of a graph
- Some Ramsey-Type Numbers and the Independence Ratio
- Domination-balanced graphs
- A new domination conception
- A characterization of trees with equal 2-domination and 2-independence numbers
- Trees with equal 2-domination and 2-independence numbers
- On the total k-domination number of graphs
- On Dominating Sets and Independent Sets of Graphs
- Cartesian product graphs and k-tuple total domination
- Topics in Domination in Graphs
- The 2-domination and Roman domination numbers of grid graphs
- K-tuple total domination in inflated graphs
- Claw-free graphs with equal 2-domination and domination numbers
- Graphs with double domination numbers
- On Double Domination in Graphs
- Characterization of block graphs with equal 2-domination number and domination number plus one
- Exact double domination in graphs
- Some results on total domination in direct products of graphs
- On domination and annihilation in graphs with claw-free blocks
- A note on the \(k\)-tuple total domination number of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
