Graphs with large restrained domination number
From MaRDI portal
Publication:1292850
Recommendations
- Restrained domination in graphs with minimum degree two
- An upper bound on the restrained domination number of graphs.
- All graphs with restrained domination number three less than their order
- Maximum sizes of graphs with given restrained domination numbers
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
Cites work
- scientific article; zbMATH DE number 1055145 (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?)
- Domination in graphs with minimum degree two
- Domination-balanced graphs
- Paths, Stars and the Number Three
- Restrained domination in graphs with minimum degree two
Cited in
(27)- Restrained Roman domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Bounds on the total restrained domination number of a graph
- Restrained domination in claw-free graphs with minimum degree at least two
- All graphs with restrained domination number three less than their order
- \([1,2]\)-sets in graphs
- Weighted restrained domination in subclasses of planar graphs
- On total restrained domination in graphs
- Movable restrained-domination in the Corona of graphs
- Maximum sizes of graphs with given restrained domination numbers
- Restrained domination in self-complementary graphs
- On bondage numbers of graphs: a survey with some comments
- Restrained domination in cubic graphs
- NP-completeness and APX-completeness of restrained domination in graphs
- Restrained and total restrained domination in graphs
- Best possible upper bounds on the restrained domination number of cubic graphs
- scientific article; zbMATH DE number 7273137 (Why is no real title available?)
- Restrained bondage in graphs
- Total restrained domination in graphs with minimum degree two
- Characterizations of trees with equal domination parameters
- Restrained domination in unicyclic graphs
- An upper bound on the restrained domination number of graphs.
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Graphs of maximum diameter
- Bounds on domination parameters in graphs: a brief survey
This page was built for publication: Graphs with large restrained domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292850)