Restricted domination in graphs
From MaRDI portal
Recommendations
Cited in
(21)- Restricted total domination in graphs
- Girth and total domination in graphs
- Domination versus total domination in claw-free cubic graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Restricted power domination and zero forcing problems
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Restricted domination parameters in graphs
- Restricted domination in arc-colored digraphs
- Restrained domination and its variants in extended supergrid graphs
- Restrained domination in graphs with minimum degree two
- Domination and irredundance in graphs with restricted blocks
- Weighted restrained domination in subclasses of planar graphs
- Restricted total domination in graphs with minimum degree two
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- scientific article; zbMATH DE number 5635305 (Why is no real title available?)
- scientific article; zbMATH DE number 617572 (Why is no real title available?)
- Bounds related to domination in graphs with minimum degree two
- Bounds on k-part degree restricted domination number of a graph
- On restricted domination in graphs
- Domination number in graphs with minimum degree two
- Restricted domination in graphs with minimum degree 2
This page was built for publication: Restricted domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613539)
