Graphs with large restrained domination number
From MaRDI portal
Publication:1292850
DOI10.1016/S0012-365X(99)90095-XzbMATH Open0932.05070OpenAlexW4210804086MaRDI QIDQ1292850FDOQ1292850
Publication date: 27 February 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90095-x
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (21)
- Characterizations of trees with equal domination parameters
- Best possible upper bounds on the restrained domination number of cubic graphs
- Graphs of maximum diameter
- Restrained domination in self-complementary graphs
- Weighted restrained domination in subclasses of planar graphs
- On total restrained domination in graphs
- Title not available (Why is that?)
- NP-completeness and APX-completeness of restrained domination in graphs
- Restrained domination in cubic graphs
- Title not available (Why is that?)
- Restrained domination in claw-free graphs with minimum degree at least two
- On bondage numbers of graphs: a survey with some comments
- Bounds on domination parameters in graphs: a brief survey
- 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
- Restrained bondage in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Bounds on the total restrained domination number of a graph
- Restrained and Total Restrained Domination in Graphs
- Total restrained domination in graphs with minimum degree two
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
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)
