k-domination and k-independence in graphs: A survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6383843 (Why is no real title available?)
- scientific article; zbMATH DE number 5995289 (Why is no real title available?)
- scientific article; zbMATH DE number 4191719 (Why is no real title available?)
- scientific article; zbMATH DE number 4191722 (Why is no real title available?)
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 5613482 (Why is no real title available?)
- scientific article; zbMATH DE number 5289574 (Why is no real title available?)
- scientific article; zbMATH DE number 5543124 (Why is no real title available?)
- scientific article; zbMATH DE number 5556294 (Why is no real title available?)
- scientific article; zbMATH DE number 3918387 (Why is no real title available?)
- scientific article; zbMATH DE number 3970788 (Why is no real title available?)
- scientific article; zbMATH DE number 3675921 (Why is no real title available?)
- scientific article; zbMATH DE number 19197 (Why is no real title available?)
- scientific article; zbMATH DE number 49665 (Why is no real title available?)
- scientific article; zbMATH DE number 146666 (Why is no real title available?)
- scientific article; zbMATH DE number 3531438 (Why is no real title available?)
- scientific article; zbMATH DE number 731842 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1124606 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 2544 (Why is no real title available?)
- scientific article; zbMATH DE number 5806 (Why is no real title available?)
- scientific article; zbMATH DE number 6007 (Why is no real title available?)
- scientific article; zbMATH DE number 3999967 (Why is no real title available?)
- scientific article; zbMATH DE number 4121429 (Why is no real title available?)
- scientific article; zbMATH DE number 795022 (Why is no real title available?)
- scientific article; zbMATH DE number 1444486 (Why is no real title available?)
- scientific article; zbMATH DE number 3432294 (Why is no real title available?)
- scientific article; zbMATH DE number 5238170 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- scientific article; zbMATH DE number 2188616 (Why is no real title available?)
- scientific article; zbMATH DE number 2188621 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- scientific article; zbMATH DE number 2230941 (Why is no real title available?)
- 2-domination subdivision number of graphs
- 3-Tuple domination number in complete grid graphs
- A Nordhaus-Gaddum-type result for the 2-domination number
- A bound on the \(k\)-domination number of a graph.
- A characterization of \((\gamma_t,\gamma_2)\)-trees
- A general method in the theory of domination in graphs
- A generalised upper bound for the \(k\)-tuple domination number
- A generalization of maximal independent sets
- A new domination conception
- A note on Nordhaus-Gaddum inequalities for domination.
- A note on the double domination number in trees
- A note on the k-domination number of a graph
- A note on the p-domination number of trees
- A realization algorithm for double domination in graphs
- A remark on the (2,2)-domination number
- An alternative definition of the \(k\)-irredundance
- An upper bound for thek-domination number of a graph
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Bounds of the 2-domination number of graphs
- Bounds on double domination numbers of graphs
- Bounds on the \(k\)-domination number of a graph
- Bounds on the \(k\)-tuple domatic number of a graph
- Bounds on the connected \(k\)-domination number in graphs
- Bounds on the upper \(k\)-domination number and the upper \(k\)-star-forming number of a graph
- Characterization of block graphs with equal 2-domination number and domination number plus one
- Characterization of graphs with equal domination and covering number
- Characterization of trees with equal 2-domination number and domination number plus two
- Characterizations of trees with equal paired and double domination numbers
- Claw-free graphs with equal 2-domination and domination numbers
- Connected Domination and Spanning Trees with Many Leaves
- Connected \(p\)-domination in graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Dominating a family of graphs with small connected subgraphs
- Domination-balanced graphs
- Double domination stable graphs upon edge removal
- Exact double domination in graphs
- Extremal problems for roman domination
- Graphs whose vertex independence number is unaffected by single edge addition or deletion
- Graphs with double domination numbers
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Implications of some observations about the \(k\)-domination number
- Improved lower bounds on k‐independence
- Independence and 2-domination in bipartite graphs
- Independence and \(k\)-domination in graphs
- Independent and double domination in trees
- Inequalities involving independence domination, f-domination, connected and total f-domination numbers
- Lower bounds on the \(p\)-domination number in terms of cycles and matching number
- Maximal k-independent sets in graphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- Nordhaus-Gaddum inequalities for domination in graphs
- On $f$-domination number of a graph
- On $k$-domatic numbers of graphs
- On 2-domination and independence domination numbers of graphs.
- On Double Domination in Graphs
- On Hadwiger's Number and the Stability Number
- On \(k\)-dependent domination
- On \(k\)-domination and \(j\)-independence in graphs
- On \(k\)-independence in graphs with emphasis on trees
- On \(k\)-star-forming sets in graphs
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- On a relationship between 2-dominating and 5-dominating sets in graphs
- On conjectures of Graffiti
- On domination and annihilation in graphs with claw-free blocks
- On domination and independent domination numbers of a graph
- On graphs having domination number half their order
- On graphs with equal domination and 2-domination numbers
- On perfect and unique maximum independent sets in graphs.
- On perfect double dominating sets in grids, cylinders and tori
- On the \((2,2)\)-domination number of trees
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- On the \(p\)-domination, the total domination and the connected domination numbers of graphs
- On the corona of two graphs
- On the domination number of a random graph
- On the p-domination number of cactus graphs
- On the ratio of optimal integral and fractional covers
- On the residue of a graph
- Onk-domination and minimum degree in graphs
- Onk-tuple domination of random graphs
- Perfect \(k\)-domination in graphs
- Perfect stables in graphs
- Proof of a conjecture on \(k\)-tuple domination in graphs
- Ratios of some domination parameters in graphs and claw-free graphs
- Ratios of some domination parameters in trees
- Relations between packing and covering numbers of a tree
- Restrained double domination number of a graph
- Roman \(k\)-domination in graphs
- Roman domination in graphs.
- Some bounds on the \(p\)-domination number in trees
- Some remarks on lower bounds on the \(p\)-domination number in trees
- Some results on total domination in direct products of graphs
- The \(k\)-domatic number of a graph
- The \(k\)-tuple domination number revisited
- The insulation sequence of a graph
- The roman domatic number of a graph
- Towards a theory of domination in graphs
- Transversal numbers of uniform hypergraphs
- Trees whose double domination number is twice their domination number
- Trees with two disjoint minimum independent dominating sets
- Trees with unique minimum \(p\)-dominating sets
- Upper bounds for \(f\)-domination number of graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- \(H\)-forming sets in graphs
- \(k\)-independence stable graphs upon edge removal
- \(k\)-tuple domination in graphs
- k-Independence and thek-residue of a graph
Cited in
(91)- On general frameworks and threshold functions for multiple domination
- On approximating (connected) 2-edge dominating set by a tree
- scientific article; zbMATH DE number 4057563 (Why is no real title available?)
- NP-hardness of multiple bondage in graphs
- Admissible property of graphs in terms of radius
- Domination number, independent domination number and 2-independence number in trees
- On approximating (connected) 2-edge dominating set by a tree
- Making a dominating set of a graph connected
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- On (1,2)-domination in cubic graphs
- Relating the annihilation number and the 2-domination number of a tree
- Decreasing the maximum degree of a graph
- On vertex independence number of uniform hypergraphs
- On the signed (total) \(k\)-independence number in graphs
- Balanced independent and dominating sets on colored interval graphs
- \([1,k]\)-domination number of lexicographic products of graphs
- \( K_{1 , 2}\)-isolation in graphs
- Independent \((k + 1)\)-domination in \(k\)-trees
- On the \(k\)-domination number of digraphs
- Perfect domination ratios of Archimedean lattices
- Multiple domination
- Bipartite graphs with close domination and \(k\)-domination numbers
- On the packing numbers in graphs
- Relating the annihilation number and the 2-domination number of block graphs
- Roman domination and 2-independence in trees
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- Algorithm to find a maximum 2-packing set in a cactus
- On bondage numbers of graphs: a survey with some comments
- \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems
- Covers and partial transversals of Latin squares
- On \(k\)-domination and \(j\)-independence in graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Bounds on the 2-domination number
- Isolation of cycles
- A note on the annihilation number and 2-domination number of a tree
- Partitions of graphs into small and large sets
- The \(k\)-independence number of graph products
- A Taxonomy of Perfect Domination
- Algorithmic and structural aspects of the \(P_3\)-Radon number
- An upper bound on the \(P_3\)-Radon number
- Domination, independent domination and \(k\)-independence in trees
- Isolation of \(k\)-cliques
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
- Edge domination and 2-independence in trees
- Partial domination -- the isolation number of a graph
- Grundy dominating sequences and zero forcing sets
- On the \(p\)-reinforcement and the complexity
- Client-server and cost effective sets in graphs
- Independent Roman domination and 2-independence in trees
- Constructing dominating sets in circulant graphs
- A new generalization of kernels in digraphs
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- Domatically full Cartesian product graphs
- On \(k\)-dependent domination
- Trees with 2-reinforcement number three
- On the complexity of reinforcement in graphs
- (K, j)-domination and (K, j)-reliability
- Zero forcing in claw-free cubic graphs
- The difference between the metric dimension and the determining number of a graph
- Trees with maximum \(p\)-reinforcement number
- Upper bounds on the \(k\)-forcing number of a graph
- On upper bounds for multiple domination numbers of graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- On the complexity of multiple bondage in graphs
- Heuristics for \(k\)-domination models of facility location problems in street networks
- Another look at \(k\)-domination in graphs
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- \(k\)-isolation in graphs
- Algorithmic study on 2-transitivity of graphs
- A note on the \(P_3\)-isolation number of a graph
- Conjectures of TxGraffiti: independence, domination, and matchings
- scientific article; zbMATH DE number 7764102 (Why is no real title available?)
- Nordhaus-Gaddum-type results on the connected edge domination number
- The annihilation number does not bound the 2-domination number from the above
- Perfect Italian domination on planar and regular graphs
- Distinguished minimal topological lassos
- Graphs with \(\alpha _1\) and \(\tau _1\) both large
- Further results on the \(j\)-independence number of graphs
- Complexity results on \(k\)-independence in some graph products
- MAX for \(k\)-independence in multigraphs
- (Open) packing number of some graph products
- The \(p\)-domination number of complete multipartite graphs
- 2-independent domination in trees
- \(K_{1, 2}\)-isolation number of claw-free cubic graphs
- Bounds on the Twin-Width of Product Graphs
- On the signed \(2\)-independence number of graphs
- On the 2-independence subdivision number of graphs
- Thresholds for the monochromatic clique transversal game
- Mixed Roman domination and 2-independence in trees
- \( P_5\)-isolation in graphs
This page was built for publication: \(k\)-domination and \(k\)-independence in graphs: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659765)
