Best possible upper bounds on the restrained domination number of cubic graphs
From MaRDI portal
(Redirected from Publication:6565811)
Recommendations
- Restrained domination in cubic graphs
- An improved upper bound on the total restrained domination number in cubic graphs
- scientific article; zbMATH DE number 6820568
- A new bound on the domination number of connected cubic graphs
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
Cites work
- A characterization of cubic graphs with paired-domination number three-fifths their order
- A new bound on the domination number of connected cubic graphs
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Bounds on domination parameters in graphs: a brief survey
- Cubic graphs with large ratio of independent domination number to domination number
- Domination in Cubic Graphs of Large Girth
- Domination in graphs with minimum degree two
- Domination in Graphs: Core Concepts
- Domination number of cubic graphs with large girth
- Domination versus independent domination in cubic graphs
- Graphs with large restrained domination number
- Independent domination in bipartite cubic graphs
- Independent domination in cubic graphs
- On domination in 2-connected cubic graphs
- Paths, Stars and the Number Three
- Power domination in cubic graphs and Cartesian products
- Restrained and total restrained domination in graphs
- Restrained domination in cubic graphs
- Restrained domination in graphs
- Restrained domination in graphs with minimum degree two
- Semipaired domination in claw-free cubic graphs
- Topics in Domination in Graphs
- Total domination in graphs
- Total domination versus domination in cubic graphs
- Total forcing versus total domination in cubic graphs
This page was built for publication: Best possible upper bounds on the restrained domination number of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565811)
