Multiple domination
From MaRDI portal
Publication:3384609
DOI10.1007/978-3-030-51117-3_6zbMATH Open1479.05267OpenAlexW4211174266MaRDI QIDQ3384609FDOQ3384609
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Claw-free graphs with equal 2-domination and domination numbers
- Graphs with double domination numbers
- Some remarks on lower bounds on the \(p\)-domination number in trees
- Title not available (Why is that?)
- 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
- Onk-tuple domination of random graphs
- On graphs with equal domination and covering numbers
- Graphs with equal domination and covering numbers
- Dynamical \(2\)-domination in graphs.
- Bounds on the 2-domination number
- Topics in Domination in Graphs
- On general frameworks and threshold functions for multiple domination
- Sunflower hypergraphs are chromatically unique
- On the total \(k\)-domination in graphs
- On the total \(k\)-domination number of graphs
- A note on the \(k\)-tuple total domination number of a graph
- A characterization of trees with equal 2-domination and 2-independence numbers
- Upper \(k\)-tuple total domination in graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Minimum 2-tuple dominating set of permutation graphs
- Title not available (Why is that?)
- \(k\)-tuple and \(k\)-domination on the rook's graph and other results
- Title not available (Why is that?)
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Title not available (Why is that?)
- Restricted domination parameters in graphs
- Bipartite graphs with close domination and \(k\)-domination numbers
- On the \(k\)-domination number, the domination number and the cycle of length four
- Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
- Trees with equal 2-domination and 2-independence numbers
- The 2-domination and Roman domination numbers of grid graphs
- \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
- Bounds on the \(l\)-total \(k\)-domatic number of a graph
- \(k\)-tuple total domatic number of a graph
- \(k\)-tuple total domination and Mycieleskian graphs
- Double domination in the Cartesian and tensor products of graphs
- Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs
- Title not available (Why is that?)
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- On the ratio of optimal integral and fractional covers
- Transversal numbers of uniform hypergraphs
- New approach to the \(k\)-independence number of a graph
- On \(k\)-domination and \(j\)-independence in graphs
- Some bounds on the \(p\)-domination number in trees
- Trees with unique minimum \(p\)-dominating sets
- Independence and \(k\)-domination in graphs
- Onk-domination and minimum degree in graphs
- Title not available (Why is that?)
- Domination-balanced graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Total domination of graphs and small transversals of hypergraphs
- Strong transversals in hypergraphs and double total domination in graphs
- Intersection Theorems for Systems of Sets
- Hypergraphs with large transversal number and with edge sizes at least 3
- Title not available (Why is that?)
- \(k\)-tuple total domination in graphs
- Grundy number and products of graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Critical concepts in domination
- On some extremal problems in graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On domination and independent domination numbers of a graph
- On the approximability and exact algorithms for vector domination and related problems in graphs
- Title not available (Why is that?)
- On Dominating Sets and Independent Sets of Graphs
- \(k\)-tuple domination in graphs
- On the total domination number of Cartesian products of graphs
- Independent sets in triangle-free cubic planar graphs
- An upper bound for thek-domination number of a graph
- Vizing's conjecture: a survey and recent results
- On graphs having domination number half their order
- The multiple domination and limited packing problems in graphs
- Bounds for the 2-domination number of toroidal grid graphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- Title not available (Why is that?)
- The \(k\)-domatic number of a graph
- Nordhaus-Gaddum inequalities for domination in graphs
- On graphs with equal domination and 2-domination numbers
- Bounds of the 2-domination number of graphs
- Title not available (Why is that?)
- Independence and 2-domination in bipartite graphs
- Ratios of some domination parameters in trees
- Characterizations of trees with equal paired and double domination numbers
- Implications of some observations about the \(k\)-domination number
- A new domination conception
- Title not available (Why is that?)
- A note on the k-domination number of a graph
- Total domination in graphs with given girth
- An inequality related to Vizing's conjecture
- Total \(k\)-domination in Cartesian product graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- \(k\)-tuple total domination in cross products of graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Title not available (Why is that?)
- Some Ramsey-Type Numbers and the Independence Ratio
- Cartesian product graphs and \(k\)-tuple total domination
- A note on Nordhaus-Gaddum inequalities for domination.
- Title not available (Why is that?)
- The upper bound on \(k\)-tuple domination numbers of graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Title not available (Why is that?)
- Invariants concerning \(f\)-domination in graphs
- Upper bounds for \(f\)-domination number of graphs
- On upper bounds for multiple domination numbers of graphs
- A generalised upper bound for the \(k\)-tuple domination number
- 3-Tuple domination number in complete grid graphs
- On Double Domination in Graphs
- The \(k\)-tuple domination number revisited
- Proof of a conjecture on \(k\)-tuple domination in graphs
- Dominating a family of graphs with small connected subgraphs
- Independent and double domination in trees
- Bounds on the connected \(k\)-domination number in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- New results on \(k\)-independence of graphs
- New bounds on the Grundy number of products of graphs
- Title not available (Why is that?)
- Bounds on double domination numbers of graphs
- K-tuple total domination in inflated graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- A general method in the theory of domination in graphs
- Connected \(p\)-domination in graphs
- Title not available (Why is that?)
- \(H\)-forming sets in graphs
- On a relationship between 2-dominating and 5-dominating sets in graphs
- On 2-domination and independence domination numbers of graphs.
- A bound on the \(k\)-domination number of a graph.
- Ratios of some domination parameters in graphs and claw-free graphs
- A Nordhaus-Gaddum-type result for the 2-domination number
- Title not available (Why is that?)
- A realization algorithm for double domination in graphs
- On the \(p\)-domination, the total domination and the connected domination numbers of graphs
- Title not available (Why is that?)
- Lower bounds on the \(p\)-domination number in terms of cycles and matching number
Cited In (14)
- Bounds relating generalized domination parameters
- On upper bounds for multiple domination numbers of graphs
- Some new results on the \(k\)-tuple domination number of graphs
- \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
- The diversity of domination
- On general frameworks and threshold functions for multiple domination
- Relating the super domination and 2-domination numbers in cactus graphs
- New bounds on the double total domination number of graphs
- A note on the k-tuple domination number of graphs
- Double total domination in the generalized lexicographic product of graphs
- The many facets of upper domination
- Paired versus double domination in forbidden graph classes
- Graphs with unique minimum specified domination sets
- Double domination in rooted product graphs
This page was built for publication: Multiple domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384609)
