Graphs with large restrained domination number
From MaRDI portal
Publication:1292850
DOI10.1016/S0012-365X(99)90095-XzbMath0932.05070OpenAlexW4210804086MaRDI QIDQ1292850
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
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (18)
Weighted restrained domination in subclasses of planar graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Bounds on the total restrained domination number of a graph ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Restrained domination in self-complementary graphs ⋮ 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 ⋮ Total restrained domination in graphs with minimum degree two ⋮ Characterizations of trees with equal domination parameters ⋮ An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree ⋮ Restrained domination in claw-free graphs with minimum degree at least two ⋮ Restrained domination in cubic graphs ⋮ Restrained bondage in graphs ⋮ On total restrained domination in graphs ⋮ Remarks on restrained domination and total restrained domination in graphs ⋮ Restrained and Total Restrained Domination in Graphs ⋮ Unnamed Item
Cites Work
This page was built for publication: Graphs with large restrained domination number
