A note on the k-domination number of a graph
From MaRDI portal
Publication:919005
DOI10.1155/S016117129000031XzbMATH Open0706.05033OpenAlexW2053891773MaRDI QIDQ919005FDOQ919005
Authors: Yair Caro, Yehuda Roditty 
Publication date: 1990
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/46506
Recommendations
- scientific article; zbMATH DE number 4014771
- Note on the domination unmber of a graph
- A note on the k-tuple domination number of graphs
- A note on the number of dominating sets of a graph
- A note on graphs with largest total \(k\)-domination number.
- A note on the \(k\)-tuple total domination number of a graph
- A note on the domination number of a graph and its complement
- scientific article; zbMATH DE number 1161328
- On the total \(k\)-domination number of graphs
- On the total \(k\)-domination in graphs
Cited In (49)
- On the domination number of Hamiltonian graphs with minimum degree six
- Relating the annihilation number and the 2-domination number of a tree
- Title not available (Why is that?)
- A note on the annihilation number and 2-domination number of a tree
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- The \(p\)-bondage number of trees
- A bound on the \(k\)-domination number of a graph.
- Trees with maximum \(p\)-reinforcement number
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A note on the domination number of a graph and its complement
- Bounds on weak Roman and 2-rainbow domination numbers
- On Dominating Sets and Independent Sets of Graphs
- Independence and \(k\)-domination in graphs
- The annihilation number does not bound the 2-domination number from the above
- Note on the domination unmber of a graph
- On general frameworks and threshold functions for multiple domination
- An upper bound for domination number of 5-regular graphs
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems
- On the \(p\)-reinforcement and the complexity
- Minimum 2-dominating sets in regular graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Bounds on the \(k\)-domination number of a graph
- On \(k\)-domination and \(j\)-independence in graphs
- Data reductions and combinatorial bounds for improved approximation algorithms
- Some bounds on the \(p\)-domination number in trees
- Another look at \(k\)-domination in graphs
- On $f$-domination number of a graph
- Bipartite graphs with close domination and \(k\)-domination numbers
- General bounds on rainbow domination numbers
- Independent \((k + 1)\)-domination in \(k\)-trees
- A note on the \(k\)-tuple total domination number of a graph
- On certain spanning subgraphs of embeddings with applications to domination
- Title not available (Why is that?)
- Varieties of Roman Domination
- Onk-domination and minimum degree in graphs
- Exponential domination in subcubic graphs
- Domination in graphs of minimum degree five
- On the \(k\)-domination number, the domination number and the cycle of length four
- A polynomial-time approximation to a minimum dominating set in a graph
- Upper bounds for \(f\)-domination number of graphs
- Title not available (Why is that?)
- Bounds on the exponential domination number
- Relating the annihilation number and the 2-domination number of block graphs
- Bounds on the 2-domination number
- Domination in bipartite graphs
- Multiple domination
- The \(p\)-domination number of complete multipartite graphs
- A note on bounds for the broadcast domination number of graphs
This page was built for publication: A note on the k-domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q919005)
